Algorithmics for Hard Problems

Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics

Author: Juraj Hromkovič

Publisher: Springer Science & Business Media

ISBN: 3662046164

Category: Computers

Page: 494

View: 7459

An introduction to the methods of designing algorithms for hard computing tasks, concentrating mainly on approximate, randomized, and heuristic algorithms, and on the theoretical and experimental comparison of these approaches according to the requirements of the practice. This is the first book to systematically explain and compare all the main possibilities of attacking hard computing problems. It also closes the gap between theory and practice by providing at once a graduate textbook and a handbook for practitioners dealing with hard computing problems.

Combinatorial Algorithms

24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013. Revised Selected Papers

Author: Thierry Lecroq,Laurent Mouchard

Publisher: Springer

ISBN: 3642452787

Category: Computers

Page: 474

View: 6603

This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry and satisfiability.

Computer Science -- Theory and Applications

5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010, Proceedings

Author: Farid Ablayev

Publisher: Springer Science & Business Media

ISBN: 3642131816

Category: Computers

Page: 397

View: 8528

The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available. The scope of LNCS, including its subseries LNAI and LNBI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. In parallel to the printed book, each new volume is published electronically in LNCS Online.

Verification of Reactive Systems

Formal Methods and Algorithms

Author: Klaus Schneider

Publisher: Springer Science & Business Media

ISBN: 9783540002963

Category: Computers

Page: 600

View: 9250

This book is a solid foundation of the most important formalisms used for specification and verification of reactive systems. In particular, the text presents all important results on m-calculus, w-automata, and temporal logics, shows the relationships between these formalisms and describes state-of-the-art verification procedures for them. It also discusses advantages and disadvantages of these formalisms, and shows up their strengths and weaknesses. Most results are given with detailed proofs, so that the presentation is almost self-contained. Includes all definitions without relying on other material Proves all theorems in detail Presents detailed algorithms in pseudo-code for verification as well as translations to other formalisms

Theoretical Computer Science

Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

Author: Juraj Hromkovič

Publisher: Springer Science & Business Media

ISBN: 9783540140153

Category: Computers

Page: 313

View: 8132

Juraj Hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. The author shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles. The book also presents the development of the computer scientist's way of thinking as well as fundamental concepts such as approximation and randomization in algorithmics, and the basic ideas of cryptography and interconnection network design.


From Design to Implementation

Author: El-Ghazali Talbi

Publisher: John Wiley & Sons

ISBN: 9780470496909

Category: Computers

Page: 500

View: 6599

A unified view of metaheuristics This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling. It presents the main design questions for all families of metaheuristics and clearly illustrates how to implement the algorithms under a software framework to reuse both the design and code. Throughout the book, the key search components of metaheuristics are considered as a toolbox for: Designing efficient metaheuristics (e.g. local search, tabu search, simulated annealing, evolutionary algorithms, particle swarm optimization, scatter search, ant colonies, bee colonies, artificial immune systems) for optimization problems Designing efficient metaheuristics for multi-objective optimization problems Designing hybrid, parallel, and distributed metaheuristics Implementing metaheuristics on sequential and parallel machines Using many case studies and treating design and implementation independently, this book gives readers the skills necessary to solve large-scale optimization problems quickly and efficiently. It is a valuable reference for practicing engineers and researchers from diverse areas dealing with optimization or machine learning; and graduate students in computer science, operations research, control, engineering, business and management, and applied mathematics.

Introduction to the Theory of Complexity

Author: Daniele Bovet,Pierluigi Crescenzi

Publisher: Prentice Hall PTR

ISBN: 9780139153808

Category: Mathematics

Page: 282

View: 3074

The aim of this book is to review in a systematic way the most significant results obtained in the study of computational complexity theory. A balanced approach which is partly algorithmic and partly structuralist is followed. From an algorithmic point of view, the book is concerned with properties of complexity classes, and identification of structural properties of sets that affect their computational complexity.

Applied Integer Programming

Modeling and Solution

Author: Der-San Chen,Robert G. Batson,Yu Dang

Publisher: John Wiley & Sons

ISBN: 1118210026

Category: Mathematics

Page: 468

View: 3696

An accessible treatment of the modeling and solution of integer programming problems, featuring modern applications and software In order to fully comprehend the algorithms associated with integer programming, it is important to understand not only how algorithms work, but also why they work. Applied Integer Programming features a unique emphasis on this point, focusing on problem modeling and solution using commercial software. Taking an application-oriented approach, this book addresses the art and science of mathematical modeling related to the mixed integer programming (MIP) framework and discusses the algorithms and associated practices that enable those models to be solved most efficiently. The book begins with coverage of successful applications, systematic modeling procedures, typical model types, transformation of non-MIP models, combinatorial optimization problem models, and automatic preprocessing to obtain a better formulation. Subsequent chapters present algebraic and geometric basic concepts of linear programming theory and network flows needed for understanding integer programming. Finally, the book concludes with classical and modern solution approaches as well as the key components for building an integrated software system capable of solving large-scale integer programming and combinatorial optimization problems. Throughout the book, the authors demonstrate essential concepts through numerous examples and figures. Each new concept or algorithm is accompanied by a numerical example, and, where applicable, graphics are used to draw together diverse problems or approaches into a unified whole. In addition, features of solution approaches found in today's commercial software are identified throughout the book. Thoroughly classroom-tested, Applied Integer Programming is an excellent book for integer programming courses at the upper-undergraduate and graduate levels. It also serves as a well-organized reference for professionals, software developers, and analysts who work in the fields of applied mathematics, computer science, operations research, management science, and engineering and use integer-programming techniques to model and solve real-world optimization problems.

Stochastic Local Search

Foundations and Applications

Author: Holger H. Hoos,Thomas Stützle

Publisher: Morgan Kaufmann

ISBN: 1558608729

Category: Business & Economics

Page: 658

View: 8308

Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems. Offering a systematic treatment of SLS algorithms, this book examines the general concepts and specific instances of SLS algorithms and considers their development, analysis and application.

Evolutionary Optimization Algorithms

Author: Dan Simon

Publisher: John Wiley & Sons

ISBN: 1118659503

Category: Mathematics

Page: 772

View: 3235

A clear and lucid bottom-up approach to the basic principles of evolutionary algorithms Evolutionary algorithms (EAs) are a type of artificial intelligence. EAs are motivated by optimization processes that we observe in nature, such as natural selection, species migration, bird swarms, human culture, and ant colonies. This book discusses the theory, history, mathematics, and programming of evolutionary optimization algorithms. Featured algorithms include genetic algorithms, genetic programming, ant colony optimization, particle swarm optimization, differential evolution, biogeography-based optimization, and many others. Evolutionary Optimization Algorithms: Provides a straightforward, bottom-up approach that assists the reader in obtaining a clear—but theoretically rigorous—understanding of evolutionary algorithms, with an emphasis on implementation Gives a careful treatment of recently developed EAs—including opposition-based learning, artificial fish swarms, bacterial foraging, and many others— and discusses their similarities and differences from more well-established EAs Includes chapter-end problems plus a solutions manual available online for instructors Offers simple examples that provide the reader with an intuitive understanding of the theory Features source code for the examples available on the author's website Provides advanced mathematical techniques for analyzing EAs, including Markov modeling and dynamic system modeling Evolutionary Optimization Algorithms: Biologically Inspired and Population-Based Approaches to Computer Intelligence is an ideal text for advanced undergraduate students, graduate students, and professionals involved in engineering and computer science.

Evolutionary Computation for Modeling and Optimization

Author: Daniel Ashlock

Publisher: Springer Science & Business Media

ISBN: 9780387319094

Category: Computers

Page: 572

View: 8282

Concentrates on developing intuition about evolutionary computation and problem solving skills and tool sets. Lots of applications and test problems, including a biotechnology chapter.

Complexity Theory and Cryptology

An Introduction to Cryptocomplexity

Author: Jörg Rothe

Publisher: Springer Science & Business Media

ISBN: 3540285202

Category: Computers

Page: 478

View: 9029

Modern cryptology increasingly employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research topics in complexity theory are often motivated by questions and problems from cryptology. This book takes account of this situation, and therefore its subject is what may be dubbed "cryptocomplexity'', a kind of symbiosis of these two areas. This book is written for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Moreover, it may serve as a valuable source for researchers, teachers, and practitioners working in these fields. Starting from scratch, it works its way to the frontiers of current research in these fields and provides a detailed overview of their history and their current research topics and challenges.

Automata, Languages and Programming

29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002. Proceedings

Author: Peter Widmayer,Francisco Triguero,Rafael Morales,Matthew Hennessy,Stephan Eidenbenz,Ricardo Conejo

Publisher: Springer

ISBN: 3540454659

Category: Computers

Page: 1072

View: 5220

Graph Theory, Computational Intelligence and Thought

Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday

Author: Marina Lipshteyn,Vadim E. Levit,Ross McConnell

Publisher: Springer Science & Business Media

ISBN: 3642020291

Category: Computers

Page: 227

View: 7410

Martin Charles Golumbic has been making seminal contributions to algorithmic graph theory and artificial intelligence throughout his career. He is universally admired as a long-standing pillar of the discipline of computer science. He has contributed to the development of fundamental research in artificial intelligence in the area of complexity and spatial-temporal reasoning as well as in the area of compiler optimization. Golumbic's work in graph theory led to the study of new perfect graph families such as tolerance graphs, which generalize the classical graph notions of interval graph and comparability graph. He is credited with introducing the systematic study of algorithmic aspects in intersection graph theory, and initiated research on new structured families of graphs including the edge intersection graphs of paths in trees (EPT) and trivially perfect graphs. Golumbic is currently the founder and director of the Caesarea Edmond Benjamin de Rothschild Institute for Interdisciplinary Applications of Computer Science at the University of Haifa. He also served as chairman of the Israeli Association of Artificial Intelligence (1998-2004), and founded and chaired numerous international symposia in discrete mathematics and in the foundations of artificial intelligence. This Festschrift volume, published in honor of Martin Charles Golumbic on the occasion of his 60th birthday, contains 20 papers, written by graduate students, research collaborators, and computer science colleagues, who gathered at a conference on subjects related to Martin Golumbic's manifold contributions in the field of algorithmic graph theory and artificial intelligence, held in Jerusalem, Tiberias and Haifa, Israel in September 2008.

The Multivariate Algorithmic Revolution and Beyond

Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday

Author: Hans L. Bodlaender,Rodney Downey,Fedor V. Fomin,Dániel Marx

Publisher: Springer

ISBN: 3642308910

Category: Computers

Page: 506

View: 3438

Parameterized complexity is currently a thriving field in complexity theory and algorithm design. A significant part of the success of the field can be attributed to Michael R. Fellows. This Festschrift has been published in honor of Mike Fellows on the occasion of his 60th birthday. It contains 20 papers that showcase the important scientific contributions of this remarkable man, describes the history of the field of parameterized complexity, and also reflects on other parts of Mike Fellows’s unique and broad range of interests, including his work on the popularization of discrete mathematics for young children. The volume contains several surveys that introduce the reader to the field of parameterized complexity and discuss important notions, results, and developments in this field.

Encyclopedia of Algorithms

Author: Ming-Yang Kao

Publisher: Springer Science & Business Media

ISBN: 0387307702

Category: Computers

Page: 1166

View: 9949

One of Springer’s renowned Major Reference Works, this awesome achievement provides a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. This first edition of the reference focuses on high-impact solutions from the most recent decade, while later editions will widen the scope of the work. All entries have been written by experts, while links to Internet sites that outline their research work are provided. The entries have all been peer-reviewed. This defining reference is published both in print and on line.

Decision Procedures

An Algorithmic Point of View

Author: Daniel Kroening,Ofer Strichman

Publisher: Springer

ISBN: 3662504979

Category: Computers

Page: 356

View: 7921

A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry. The authors introduce the basic terminology of satisfiability modulo theories and then, in separate chapters, study decision procedures for each of the following theories: propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas.

Quantum Algorithms Via Linear Algebra

A Primer

Author: Richard J. Lipton,Kenneth W. Regan

Publisher: MIT Press

ISBN: 0262028395

Category: Science

Page: 208

View: 7681

Quantum computing explained in terms of elementary linear algebra, emphasizing computation and algorithms and requiring no background in physics.