You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, and includes a thorough computational analysis of heuristic and metaheuristic algorithms.
This new edition presents information and knowledge on the field of biomedical devices and surgical tools. The authors look at the interactions between nanotechnology, nanomaterials, design, modeling, and tools for surgical and dental applications, as well as how nanostructured surfaces can be created for the purposes of improving cell adhesion between medical devices and the human body. Each original chapter is revised in this second edition and describes developments in coatings for heart valves, stents, hip and knee joints, cardiovascular devices, orthodontic applications, and regenerative materials such as bone substitutes. There are also 8 new chapters that address: Microvascular anasto...
This eBook is a collection of articles from a Frontiers Research Topic. Frontiers Research Topics are very popular trademarks of the Frontiers Journals Series: they are collections of at least ten articles, all centered on a particular subject. With their unique mix of varied contributions from Original Research to Review Articles, Frontiers Research Topics unify the most influential researchers, the latest key findings and historical advances in a hot research area! Find out more on how to host your own Frontiers Research Topic or contribute to one as an author by contacting the Frontiers Editorial Office: frontiersin.org/about/contact.
As optimization researchers tackle larger and larger problems, scale interactions play an increasingly important role. One general strategy for dealing with a large or difficult problem is to partition it into smaller ones, which are hopefully much easier to solve, and then work backwards towards the solution of original problem, using a solution from a previous level as a starting guess at the next level. This volume contains 22 chapters highlighting some recent research. The topics of the chapters selected for this volume are focused on the development of new solution methodologies, including general multilevel solution techniques, for tackling difficult, large-scale optimization problems that arise in science and industry. Applications presented in the book include but are not limited to the circuit placement problem in VLSI design, a wireless sensor location problem, optimal dosages in the treatment of cancer by radiation therapy, and facility location.
Combinatorial optimization problems are of high academical and practical importance. Unfortunately, many of them belong to the class of NP-hard problems and are therefore intractable. In other words, as their dimension increases, the time needed by exact methods to find an optimal solution grows exponentially. Metaheuristics are approximate methods for attacking these problems. An approximate method is a technique that is applied in order to find a good enough solution in a reasonable amount of time. Examples of metaheuristics are simulated annealing, tabu search, evolutionary computation, and ant colony optimization (ACO), the subject of this book. The contributions of this book to ACO research are twofold. First, some new theoretical results are proven that improve our understanding of how ACO works. Second, a new framework for ACO algorithms is proposed that is shown to perform at the state-of-the-art level on some important combinatorial optimization problems such as the k-cardinality tree problem and the group shop scheduling problem, which is a general shop scheduling problem that includes among others the well-known job shop scheduling and the open shop scheduling problems.
Metaheuristics: Progress as Real Problem Solvers is a peer-reviewed volume of eighteen current, cutting-edge papers by leading researchers in the field. Included are an invited paper by F. Glover and G. Kochenberger, which discusses the concept of Metaheuristic agent processes, and a tutorial paper by M.G.C. Resende and C.C. Ribeiro discussing GRASP with path-relinking. Other papers discuss problem-solving approaches to timetabling, automated planograms, elevators, space allocation, shift design, cutting stock, flexible shop scheduling, colorectal cancer and cartography. A final group of methodology papers clarify various aspects of Metaheuristics from the computational view point.
It is well known that there are close relations between classes of singularities and representation theory via the McKay correspondence and between representation theory and vector bundles on projective spaces via the Bernstein-Gelfand-Gelfand construction. These relations however cannot be considered to be either completely understood or fully exploited. These proceedings document recent developments in the area. The questions and methods of representation theory have applications to singularities and to vector bundles. Representation theory itself, which had primarily developed its methods for Artinian algebras, starts to investigate algebras of higher dimension partly because of these applications. Future research in representation theory may be spurred by the classification of singularities and the highly developed theory of moduli for vector bundles. The volume contains 3 survey articles on the 3 main topics mentioned, stressing their interrelationships, as well as original research papers.
Bayesian networks are a very general and powerful tool that can be used for a large number of problems involving uncertainty: reasoning, learning, planning and perception. They provide a language that supports efficient algorithms for the automatic construction of expert systems in several different contexts. The range of applications of Bayesian networks currently extends over almost all fields including engineering, biology and medicine, information and communication technologies and finance. This book is a collection of original contributions to the methodology and applications of Bayesian networks. It contains recent developments in the field and illustrates, on a sample of applications,...
None