Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

New discoveries about algorithms are leading scientists beyond the Church-Turing Thesis, which governs the "algorithmic universe" and asserts the conventionality of recursive algorithms. A new paradigm for computation, the super-recursive algorithm, offers promising prospects for algorithms of much greater computing power and efficiency. Super-Recursive Algorithms provides an accessible, focused examination of the theory of super-recursive algorithms and its ramifications for the computer industry, networks, artificial intelligence, embedded systems, and the Internet. The book demonstrates how these algorithms are more appropriate as mathematical models for modern computers, and how these algorithms present a better framework for computing methods in such areas as numerical analysis, array searching, and controlling and monitoring systems. In addition, a new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole, is developed. Problems of efficiency, software development, parallel and distributed processing, pervasive and emerging computation, computer architecture, machine learning, brain modeling, knowledge discovery, and intelligent systems are addressed. Topics and Features: * Encompasses and systematizes all main classes of super-recursive algorithms and the theory behind them * Describes the strengthening link between the theory of super-recursive algorithms and actual algorithms close to practical realization * Examines the theory's basis as a foundation for advancements in computing, information science, and related technologies * Encompasses and systematizes all main types of mathematical models of algorithms * Highlights how super-recursive algorithms pave the way for more advanced design, utilization, and maintenance of computers * Examines and restructures the existing variety of mathematical models of complexity of algorithms and computation, introducing new models * Possesses a comprehensive bibliography and index This clear exposition, motivated by numerous examples and illustrations, serves to develop a new paradigm for complex, high-performance computing based on both partial recursive functions and more inclusive recursive algorithms. Researchers and advanced students interested in theory of computation and algorithms will find the book an essential resource for an important new class of algorithms.

Complex analysis --- Computer science --- toegepaste informatica --- complexe analyse (wiskunde)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The presence of uncertainty in a system description has always been a critical issue in control. Moving on from earlier stochastic and robust control paradigms, the main objective of this book is to introduce the reader to the fundamentals of probabilistic methods in the analysis and design of uncertain systems. Using so-called "randomized algorithms", this emerging area of research guarantees a reduction in the computational complexity of classical robust control algorithms and in the conservativeness of methods like H-infinity control. Features: ¢ self-contained treatment explaining randomized algorithms from their genesis in the principles of probability theory to their use for robust analysis and controller synthesis; ¢ comprehensive treatment of sample generation, including consideration of the difficulties involved in obtaining independent and identically distributed samples; ¢ applications of randomized algorithms in congestion control of high-speed communications networks and the stability of quantized sampled-data systems. Randomized Algorithms for Analysis and Control of Uncertain Systems will be of certain interest to control theorists concerned with robust and optimal control techniques and to all control engineers dealing with system uncertainties. The present book is a very timely contribution to the literature. I have no hesitation in asserting that it will remain a widely cited reference work for many years. M. Vidyasagar

Complex analysis --- Applied physical engineering --- Engineering sciences. Technology --- procesautomatisering --- complexe analyse (wiskunde) --- systeemtheorie --- systeembeheer --- regeltechniek

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Evolutionary Multiobjective Optimization is a rare collection of the latest state-of-the-art theoretical research, design challenges and applications in the field of multiobjective optimization paradigms using evolutionary algorithms. It includes two introductory chapters giving all the fundamental definitions, several complex test functions and a practical problem involving the multiobjective optimization of space structures under static and seismic loading conditions used to illustrate the various multiobjective optimization concepts. Important features include: Detailed overview of all the multiobjective optimization paradigms using evolutionary algorithms Excellent coverage of timely, advanced multiobjective optimization topics State-of-the-art theoretical research and application developments Chapters authored by pioneers in the field Academics and industrial scientists as well as engineers engaged in research, development and application of evolutionary algorithm based Multiobjective Optimization will find the comprehensive coverage of this book invaluable.

Complex analysis --- Computer science --- Information systems --- ICT (informatie- en communicatietechnieken) --- cryptologie --- complexe analyse (wiskunde) --- informatiesystemen --- programmatielogica

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their deterministic counterparts. Computing tasks exist that require billions of years of computer work when solved using the fastest known deterministic algorithms, but they can be solved using randomized algorithms in a few minutes with negligible error probabilities. Introducing the fascinating world of randomness, this book systematically teaches the main algorithm design paradigms - foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, etc. - while also providing a deep insight into the nature of success in randomization. Taking sufficient time to present motivations and to develop the reader's intuition, while being rigorous throughout, this text is a very effective and efficient introduction to this exciting field.

Complex analysis --- Discrete mathematics --- Computer science --- discrete wiskunde --- complexe analyse (wiskunde) --- informatica --- algoritmen

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The Fourth International Conference on Unconventional Computation, UC 2005, organized under the auspices of EATCS by the Centre for Discrete Mathematics and Theoretical Computer Science and the Department of C- puter Science and Arti?cial Intelligence of the University of Seville, was held in Seville, October 3-7, 2005. Seville, one of the most beautiful cities in Spain, is at its best in October. An explosion of colour and contrast: ?amenco, bull?ghting, and a lively at- sphere in the streets due to the open and friendly nature of its people. The river Guadalquivir, the Cathedral and the Golden Tower are all places full of magic where the visitor can feel the spirit of a city which is eternally romantic. The series of International Conferences Unconventional Computation (UC),https://www.cs.auckland.ac.nz/CDMTCS/conferences/uc/isdevoted to all aspects of unconventional computation, theory as well as experiments and applications. Typical, but not exclusive, topics are: natural computing including quantum, cellular,molecular, neural and evolutionarycomputing; chaosand - namical systems based computing; and various proposals for computations that go beyond the Turing model. The ?rst venue of the Unconventional Computation Conference (formerly called Unconventional Models of Computation) was Auckland, New Zealand in 1998; subsequent sites of the conference were Brussels, Belgium in 2000 and Kobe, Japan in 2002. The titles of the proceedings volumes from past UC Conferences are as follows: 1. C.S. Calude, J. Casti, M.J. Dinneen (eds.). Unconventional Models of C- putation, Springer-Verlag, Singapore, 1998, viii + 426 pp. ISBN: 981-3083- 69-7.

Complex analysis --- Biomathematics. Biometry. Biostatistics --- Computer science --- complexe analyse (wiskunde) --- bio-informatica --- informatica --- biometrie