Some of the hardest computational problems have been successfully attacked through the use of probabilistic algorithms, which have an element of randomness to them. Concepts from the field of probability are also increasingly useful in analyzing the performance of algorithms, broadening our understanding beyond that provided by the...

The First Summer School on Theoretical Aspects on Computer Science was held
at the Institute for Studies in Theoretical Physics and Mathematics (IPM) from
July 3-10, 2000.

The idea of organizing a summer school was originated during a conversation
between the first and the second editor of this volume in the winter...

Evolutionary algorithms are becoming increasingly attractive across various disciplines, such as operations research, computer science, industrial engineering, electrical engineering, social science and economics. Introduction to Evolutionary Algorithms presents an insightful, comprehensive, and up-to-date treatment of evolutionary algorithms....

The book constitutes the joint refereed proceedings of the 11th International Conference on Relational Methods in Computer Science, RelMiCS 2009, and the 6th International Conference on Applications of Kleene Algebras, AKA 2009, held in Doha, Qatar in November 2009. The 22 revised full papers presented together with 2 invited papers were...

The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation and experimental evaluation of algorithms and data structures. The workshop was sponsored by SIAM, the Society for Industrial and Applied...

A long time ago, when younger and rasher mathematicians, we both momentarily harboured the ambition that one day, older and wiser, we might write a multivolume treatise titled “On the Mathematical Foundations of Numerical Analysis”. And then it dawned that such a creation already exists: it is called ‘a mathematics library’....

How do successful agile teams deliver bug-free, maintainable software—iteration after iteration? The answer is: By seamlessly combining development and testing. On such teams, the developers write testable code that enables them to verify it using various types of...

The second edition of a well-received book that was published 24 years ago and continues to sell to this day, An Introduction to Probability and Statistics is now revised to incorporate new information as well as substantial updates of existing material.

The theory of probability had its origin in gambling and games of chance. It owes...

Logistic systems constitute one of the cornerstones in the design and control of production systems and the modelling of supply chains. They are key to a number of industries, and courses teaching logistics systems planning and control are becoming more widespread. Introduction to Logistics Systems Planning and Control is the first book to...

Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts.

We have been very pleased, beyond our expectations, with the reception of
the first edition of this book. Bioinformatics, however, continues to evolve
very rapidly, hence the need for a new edition. In the past three years, fullgenome
sequencing has blossomed with the completion of the sequence of
the fly and the first draft of the...