Books in Theory and mathematics

51-60 of 301 results in All results

Stochastic Local Search

1st Edition
September 16, 2004
Holger H. Hoos + 1 more
English
Hardback
9 7 8 - 1 - 5 5 8 6 0 - 8 7 2 - 6
eBook
9 7 8 - 0 - 0 8 - 0 4 9 8 2 4 - 9

Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling. SLS algorithms have also become increasingly popular for solving challenging combinatorial problems in many application areas, such as e-commerce and bioinformatics.Hoos and Stützle offer the first systematic and unified treatment of SLS algorithms. In this groundbreaking new book, they examine the general concepts and specific instances of SLS algorithms and carefully consider their development, analysis and application. The discussion focuses on the most successful SLS methods and explores their underlying principles, properties, and features. This book gives hands-on experience with some of the most widely used search techniques, and provides readers with the necessary understanding and skills to use this powerful tool.

Computational Complexity: A Quantitative Perspective

1st Edition
Volume 196
July 7, 2004
Marius Zimand
English
eBook
9 7 8 - 0 - 0 8 - 0 4 7 6 6 6 - 7

There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a certain task. However, a "bad news" result does not automatically become useful in such a scenario. For this to happen, its hardness features have to be quantitatively evaluated and shown to manifest extensively.The book undertakes a quantitative analysis of some of the major results in complexity that regard either classes of problems or individual concrete problems. The size of some important classes are studied using resource-bounded topological and measure-theoretical tools. In the case of individual problems, the book studies relevant quantitative attributes such as approximation properties or the number of hard inputs at each length.One chapter is dedicated to abstract complexity theory, an older field which, however, deserves attention because it lays out the foundations of complexity. The other chapters, on the other hand, focus on recent and important developments in complexity. The book presents in a fairly detailed manner concepts that have been at the centre of the main research lines in complexity in the last decade or so, such as: average-complexity, quantum computation, hardness amplification, resource-bounded measure, the relation between one-way functions and pseudo-random generators, the relation between hard predicates and pseudo-random generators, extractors, derandomization of bounded-error probabilistic algorithms, probabilistically checkable proofs, non-approximability of optimization problems, and others.The book should appeal to graduate computer science students, and to researchers who have an interest in computer science theory and need a good understanding of computational complexity, e.g., researchers in algorithms, AI, logic, and other disciplines.

Art and Complexity

1st Edition
February 19, 2003
J. Casti + 1 more
English
Hardback
9 7 8 - 0 - 4 4 4 - 5 0 9 4 4 - 4
eBook
9 7 8 - 0 - 0 8 - 0 5 2 7 5 8 - 1

This title is the result of a one-week workshop sponsored by the Swedish research agency, FRN, on the interface between complexity and art. Among others, it includes discussions on whether "good" art is "complex" art, how artists see the term "complex", and what poets try to convey in word about complex behavior in nature.

Mathematical Logic

1st Edition
Volume 4
December 5, 2001
R.O. Gandy + 1 more
English
eBook
9 7 8 - 0 - 0 8 - 0 5 3 5 9 2 - 0

Mathematical Logic is a collection of the works of one of the leading figures in 20th-century science. This collection of A.M. Turing's works is intended to include all his mature scientific writing, including a substantial quantity of unpublished material. His work in pure mathematics and mathematical logic extended considerably further; the work of his last years, on morphogenesis in plants, is also of the greatest originality and of permanent importance. This book is divided into three parts. The first part focuses on computability and ordinal logics and covers Turing's work between 1937 and 1938. The second part covers type theory; it provides a general introduction to Turing's work on type theory and covers his published and unpublished works between 1941 and 1948. Finally, the third part focuses on enigmas, mysteries, and loose ends. This concluding section of the book discusses Turing's Treatise on the Enigma, with excerpts from the Enigma Paper. It also delves into Turing's papers on programming and on minimum cost sequential analysis, featuring an excerpt from the unpublished manuscript. This book will be of interest to mathematicians, logicians, and computer scientists.

Handbook of Automated Reasoning

1st Edition
Volume 1
June 22, 2001
Alan J.A. Robinson + 1 more
English
eBook
9 7 8 - 0 - 0 8 - 0 5 3 2 7 9 - 0

Handbook of Automated Reasoning

1st Edition
Volume II
June 21, 2001
Alan J.A. Robinson + 1 more
English
Hardback
9 7 8 - 0 - 4 4 4 - 5 0 8 1 2 - 6

CAFE: An Industrial-Strength Algebraic Formal Method

1st Edition
October 6, 2000
K. Futatsugi + 2 more
English
eBook
9 7 8 - 0 - 0 8 - 0 5 2 8 4 0 - 3

This book contains selected papers on the language, applications, and environments of CafeOBJ, which is a state-of -the-art algebraic specification language. The authors are speakers at a workshop held in 1998 to commemorate a large industrial/academic project dedicated to CafeOBJ. The project involved more than 40 people from more than 10 organisations, of which 6 are industrial. The workshop attracted about 30 talks and more than 70 attendees.The papers in the book however, are either heavily revised versions presented at the workshop, to reflect recent advancements or research; or completely new ones, written especially for this book. In this regard, the book is not a usual postpublication after a workshop. Also, although it is a compendium of papers that are related to CafeOBJ, the book is not a manual, reference, or tutorial of CafeOBJ. Probably the best description is that it is a collection of papers that investigate how to use, or to make it easy to use, CafeOBJ. Reflecting the diverse nature of the project and its participants (most of the authors are participants to the project), the papers, put together, offer a comprehensive picture from this methodological perspective.Some papers deal with various advanced aspects of the language, such as rewriting logic and behavioural logic. For rewriting logic, a couple of significant applications were reported. In particular, UML, now considered de facto standard language for modelling systems, is the subject of one paper. For behavioural logic, new methodological guidelines are presented. Some papers shed new light on a more traditional paradigm in the language; order-sorted equational specifications. One paper, in particular, deal with a way to associate CafeOBJ with object-oriented programming. The other papers deal with environments for writing and vertifying specifications written in CafeOBJ. Underlying those papers are two major considerations: user interfaces for manipulating specifications, and systematic supports for proofs. All the environments explained in the papers assume and support distributed computing, and de facto standard network technologies, such as WWW and http, are incorporated.