Page 1
Page 1
Web and Wireless Geographical Information Systems ; 7th International Symposium, W2GIS 2007, Cardiff, UK, November 28-29, 2007, Proceedings
This book constitutes the refereed proceedings of the 7th International Symposium on Web and Wireless Geographical Information Systems, W2GIS 2007, held in Cardiff, UK, in November 2007. The 21 revised full papers presented were carefully reviewed and selected from 45 submissions. The papers provide an up-to-date review of advances in recent development of Web and wireless geographical information systems and address issues like conceptual and logical models for W2GIS, data management and data retrieval methods, geographical search engines and Web services, W2GIS query languages and interface.
Visualization, Explanation and Reasoning Styles in Mathematics
Contains groundbreaking contributions to the philosophical analysis of mathematical practice. Several philosophers of mathematics have recently called for an approach to philosophy of mathematics that pays more attention to mathematical practice. Questions concerning concept-formation, understanding, heuristics, changes in style of reasoning, the role of analogies and diagrams etc.
Vehicle Propulsion Systems : Introduction to Modeling and Optimization ; 1st ed.
Automobiles are responsible for a substantial part of the world's consumption of primary energy, mostly fossil liquid hydrocarbons. The reduction of the fuel consumption of these vehicles has become a top priority. Many ideas to reach that objective have been presented. In most cases these systems are more complex than the traditional approaches. For such complex systems a heuristic design approach fails. The only way to deal with this situation is to employ model-based methods. This text provides an introduction to the mathematical modeling and subsequent optimization of vehicle propulsion systems and their supervisory control algorithms.
Vehicle Propulsion Systems : Introduction to Modeling and Optimization ; 2nd ed.
Automobiles are responsible for a substantial part of the world's consumption of primary energy, mostly fossil liquid hydrocarbons. The reduction of the fuel consumption of these vehicles has become a top priority. Many ideas to reach that objective have been presented. In most cases these systems are more complex than the traditional approaches. For such complex systems a heuristic design approach fails. The only way to deal with this situation is to employ model-based methods. This text provides an introduction to the mathematical modeling and subsequent optimization of vehicle propulsion systems and their supervisory control algorithms.
Understanding Planning Tasks : Domain Complexity and Heuristic Decomposition
Action planning has always played a central role in Artificial Intelligence. Given a description of the current situation, a description of possible actions and a description of the goals to be achieved, the task is to identify a sequence of actions, i.e., a plan that transforms the current situation into one that satisfies the goal description. The book contains an exhaustive analysis of the computational complexity of the benchmark problems that have been used in the past decade, namely the standard benchmark domains of the International Planning Competitions (IPC). At the same time, it contributes to the practice of solving planning tasks by presenting a powerful new approach to heuristic planning. The author also provides an in-depth analysis of so-called routing and transportation problems.
Time-Dependent Scheduling
Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are started. This book is a comprehensive study of complexity results and optimal and suboptimal algorithms concerning time-dependent scheduling in single-, parallel- and dedicated-machine environments. In addition to complexity issues and exact or heuristic algorithms which are typically presented in scheduling books, the author also includes more advanced topics such as matrix methods in time-dependent scheduling, and time-dependent scheduling with two criteria.
Threshold decision-making in clinical medicine : With practical application to hematology and oncology
Aims to provide threshold models to help physicians to make optimal diagnostic, therapeutic and predictive decisions. Readers will not only find theoretical information but also practical examples illustrating how these decisions should be made.
Theory of Evolutionary Computation : Recent Developments in Discrete Optimization
Reports on recent developments in the theory of evolutionary computation, or more generally the domain of randomized search heuristics. It starts with two chapters on mathematical methods that are often used in the analysis of randomized search heuristics, followed by three chapters on how to measure the complexity of a search heuristic: black-box complexity, a counterpart of classical complexity theory in black-box optimization; parameterized complexity, aimed at a more fine-grained view of the difficulty of problems; and the fixed-budget perspective, which answers the question of how good a solution will be after investing a certain computational budget. The book then describes theoretical results on three important questions in evolutionary computation: how to profit from changing the parameters during the run of an algorithm; how evolutionary algorithms cope with dynamically changing or stochastic environments; and how population diversity influences performance. Finally, the book looks at three algorithm classes that have only recently become the focus of theoretical work: estimation-of-distribution algorithms; artificial immune systems; and genetic programming.
Theory and Applications of Satisfiability Testing ; Vol. 3569 ; 8th International Conference, SAT 2005, St Andrews, Scotland, June 19-23, 2005, Proceedings
SAT is the classic problem of determining whether or not a propositional formula has a satisfying truth assignment. It was the first problem shown by Cook to be NP-complete. Despite its seemingly specialized nature, satisfiability testing has proved to extremely useful in a wide range of different disciplines, both from a practical as well as from a theoretical point of view. For example, work on SAT continues to provide insight into various fundamental problems in computation, and SAT solving technology has advanced to the point where it has become the most effective way of solving a number of practical problems. The SAT series of conferences are multidisciplinary conferences intended to bring together researchers from various disciplines who are interested in SAT. Topics of interest include, but are not limited to: proof systems and proof c- plexity; search algorithms and heuristics; analysis of algorithms; theories beyond the propositional; hard instances and random formulae; problem encodings; - dustrial applications; solvers and other tools.
Theory and Applications of Satisfiability Testing ; Vol. 3542 ; 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers
This book constitutes the refereed proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing, SAT 2004, held in Vancouver, BC, Canada in May 2004. The 24 revised full papers presented together with 2 invited papers were carefully selected from 72 submissions. In addition there are 2 reports on the 2004 SAT Solver Competition and the 2004 QBF Solver Evaluation. The whole spectrum of research in propositional and quantified Boolean formula satisfiability testing is covered; bringing together the fields of theoretical and experimental computer science as well as the many relevant application areas.
Theory and Applications of Satisfiability Testing - SAT 2008 ; 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings
All current research issues in propositional and quantified Boolean formula satisfiability testing are covered, including but not limited to proof systems, proof complexity, search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results.
Theory and Applications of Satisfiability Testing - SAT 2007; 10th International Conference, SAT 2007, Lisbon, Portugal, May 28-31, 2007, Proceedings
Contains the papers presented at SAT 2007: 10th International Conference on Theory and Applications of Satisfiability Testing. The International Conferences on Theory and Applications of SatisfiabilityTesting (SAT) originated in 1996 as a series of workshops “on Satisfability.” By the third meeting in 2000, the workshop had attracted a mix of theorists and experimentalists whose common interest was the enhancement of our basic understanding of the theoretical underpinnings of the Satisfiability problem as well as the development of scalable algorithms for its solution in a wide range of application domains. In 2002 a competition of SAT solvers was inaugurated to spur further algorithmic and implementation developments, and to create an eclectic collection of benchmarks.
Theory and Applications of Satisfiability Testing - SAT 2006 ; 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings
This book constitutes the refereed proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing, SAT 2006. The book presents 26 revised full papers together with 11 revised short papers and 2 invited talks.
Theoretical computer science and discrete mathematics
Includes 15 articles published in the Special Issue "Theoretical Computer Science and Discrete Mathematics" of Symmetry (ISSN 2073-8994). This Special Issue is devoted to original and significant contributions to theoretical computer science and discrete mathematics. The aim was to bring together research papers linking different areas of discrete mathematics and theoretical computer science, as well as applications of discrete mathematics to other areas of science and technology. The Special Issue covers topics in discrete mathematics including (but not limited to) graph theory, cryptography, numerical semigroups, discrete optimization, algorithms, and complexity.
Theoretical Aspects of Local Search
Local search has been applied successfully to a diverse collection of optimization problems. It's appreciated for its basic conceptual foundation, its general applicability, and its power to serve as a source for new search paradigms. The typical characteristics of combinatorial optimization problems to which local search can be applied, its relation to complexity theory, and the combination with randomized search features have led to a wealth of interesting theoretical results. However, these results are scattered throughout the literature. This is the first book that presents a large collection of theoretical results in a consistent manner, thus providing the reader with a coherent overview of the achievements obtained so far, but also serving as a source of inspiration for the development of novel results in the challenging field of local search.
The Vehicle Routing Problem : Latest Advances and New Challenges
The Vehicle Routing Problem (VRP) has been an especially active and fertile area of research. Over the past five to seven years, there have been numerous technological advances and exciting challenges that are of considerable interest to students, teachers, and researchers. The Vehicle Routing Problem: Latest Advances and New Challenges will focus on a host of significant technical advances that have evolved over the past few years for modeling and solving vehicle routing problems and variants. New approaches for solving VRPs have been developed from important methodological advances. These developments have resulted in faster solution algorithms, more accurate techniques, and an improvement in the ability to solve large-scale, complex problems.
The Psychodynamics of Enlightened Leadership : Coping with Chaos
This book provides a comprehensive look at the pluses and minuses of leadership in times of an unparalleled crisis, such as the COVID-19 global pandemic. It examines the COVID-19 crisis in terms of psychodynamics, crisis management, and especially from the standpoint of complex, messy systems. It analyses how leaders need to think and act differently to cope better with—unfortunately not prevent—future crises.
The Next Wave in Computing, Optimization, and Decision Technologies
The first section contains two papers on network models. The second section focuses in integer and mixed integer programming. The third section contains papers in which heuristic search and metaheuristics are applied. Three papers using stochastic modeling comprise the fourth section. In the fifth section, the unifying theme is software and modeling. The sixth section contains four papers on classification, clustering, and ranking. Each article in the volume has been carefully reviewed and revised accordingly. Computer Science and Operations Research continue to have a synergistic relationship and this book represents the results of the cross-fertilization between OR/MS and CS/AI. It is this interface of OR/CS that makes possible advances that could not have been achieved in isolation. Taken collectively, these articles are indicative of the state-of-the-art in the interface between OR/MS and CS/AI and of the high-caliber research being conducted by members of the INFORMS Computing Society.
The Fermi-Pasta-Ulam Problem : A Status Report
This volume reviews the current understanding of this paradox without trying to force coherence on differing perspectives on the same problem by various groups or approaches. The contributions comprise studies of one-dimensional chains, descriptions of numerical methods, heuristic theories, addressing the "long standing and controversial problem of distinguishing chaos from noise in signal analysis," metastability, the relation of the FPU motions with the integrable equations, approaches using methods of perturbation theory and the proof of the applicability of KAM theory in FPU chains with energy very close to a minimum. For the convenience of the reader the original work of FPU is reprinted in an appendix.
Successful Decision-making : A Systematic Approach to Complex Problems
Making decisions is certainly the most important task of a manager and it is often a very difficult one. This book offers a decision making procedure for solving complex problems step by step. Unlike other texts, the book focuses on problem analysis, on developing solution options and on establishing the decision making matrix.The book is intended for decision makers in companies, in non-profit organisations and in public administration. It is an approach to helping them to solve complex problems successfully. The book is also addressed to students and to participants in executive courses.
