Is meaningful communication possible between two intelligent parties without a common language or background? In this work, a theoretical framework is proposed in which it is possible to address when and to what extent such semantic communication is possible.
This book provides a comprehensive study of complexity results and optimal and suboptimal algorithms concerning time-dependent scheduling in single-, parallel- and dedicated-machine environments. This is the first monograph on time-dependent scheduling.
A dual purpose textbook. It is uniquely written to cover core material in the foundations of computing for graduate students in computer science and to provide an introduction to some more advanced topics for those intending further study in the field.
Wireless ad hoc sensor networks has recently become a very active research subject. This book presents high-quality contributions by leading experts worldwide on the key algorithmic and complexity-theoretic aspects of wireless sensor networks.
The P=NP question is one of the great problems of science, which has intrigued computer scientists and mathematicians for decades. This guide, originating from a weblog written by the author, covers historical developments and latest approaches to the problem.
This book presents general methods for analysing the complexity of optimisation problems cast as valued constraint satisfaction problems (VCSPs). It is an ideal resource for researchers in constraint programming and discrete optimisation.
This textbook introduces computational logic from the foundations of first-order logic to state-of-the-art decision procedures for arithmetic, data structures, and combination theories. The book also presents a logical approach to engineering correct software.
This volume provides an introduction to the fundamental concepts of logic. Written for those new to the field, the text covers both elementary topics -- proofs, models, recursive functions, etc. -- as well as more advanced principles.
There has been much interest recently in the subject of patterns in permutations and words, a new branch of combinatorics with its roots in the works of Rotem, Rogers and Knuth. This comprehensive reference volume collects the main results in the field.
This book details the results of several decades of research on developing, analyzing, and applying time models to computing and engineering. Each chapter is supplemented with detailed bibliographic remarks and exercises of varying difficulty and scope.