Listing 1 - 10 of 43 | << page >> |
Sort by
|
Choose an application
Algorithms --- Computational complexity --- Congresses --- Algorithms - Congresses --- Computational complexity - Congresses.
Choose an application
Algorithms --- Computational complexity --- Congresses --- Algorithms - Congresses --- Computational complexity - Congresses
Choose an application
Choose an application
Algebra --- Computational complexity --- Logic programming --- Algèbre --- Complexité de calcul (Informatique) --- Programmation logique --- Congresses --- Congrès --- Congresses. --- Logic programming - Congresses. --- Algebra - Congresses. --- Computational complexity - Congresses. --- Conferences - Meetings --- Logic programming - Congresses --- Algebra - Congresses --- Computational complexity - Congresses
Choose an application
This volume contains nine selected papers presented at the Borgholm conference. They were chosen on the basis of their immediate relevance to the most fundamental aspects of the theory of computation and the newest developments in this area.These papers, which have been extended and refereed, fall into eight categories: 1. Constructive Mathematics in Models of Computation and Programming; 2. Abstract Calculi and Denotational Semantics; 3. Theory of Machines, Computations and Languages; 4. Nondeterminism, Concurrency and Distributed Computing; 5. Abstract Algebras, Logics and Combinator
Choose an application
By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase.
Algebra, Boolean. --- Computational complexity --- Boolean algebra --- Boole's algebra --- Algebraic logic --- Set theory --- Algebra, Boolean --- Computational complexity - Congresses --- Algebra, Boolean - Congresses
Choose an application
Ergodic theory. Information theory --- Mathematical control systems --- Physics --- Computational complexity --- Entropy --- Physical measurements --- Quantum theory --- Congresses. --- Congresses --- Thermodynamics --- entropie --- kwantumtheorie --- natuurkunde --- Physical measurements - Congresses --- Computational complexity - Congresses --- Entropy - Congresses --- Quantum theory - Congresses
Choose an application
This book contains revised versions of papers invited for presentation at the International Workshop on Logic and Computational Complexity, LCC '94, held in Indianapolis, IN in October 1994. The synergy between logic and computational complexity has gained importance and vigor in recent years, cutting across many areas. The 25 revised full papers in this book contributed by internationally outstanding researchers document the state-of-the-art in this interdisciplinary field of growing interest; they are presented in sections on foundational issues, applicative and proof-theoretic complexity, complexity of proofs, computational complexity of functionals, complexity and model theory, and finite model theory.
Computer science --- Logic, Symbolic and mathematical --- Computational complexity --- Congresses. --- Logic [Symbolic and mathematical ] --- Congresses --- Computer science. --- Computer software. --- Logic, Symbolic and mathematical. --- Mathematics of Computing. --- Computation by Abstract Devices. --- Algorithm Analysis and Problem Complexity. --- Mathematical Logic and Formal Languages. --- Mathematical Logic and Foundations. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Software, Computer --- Computer systems --- Informatics --- Science --- Logic, Symbolic and mathematical - Congresses --- Computational complexity - Congresses.
Choose an application
Numerical and computational methods are nowadays used in a wide range of contexts in complex systems research, biology, physics, and engineering. Over the last decades different methodological schools have emerged with emphasis on different aspects of computation, such as nature-inspired algorithms, set oriented numerics, probabilistic systems and Monte Carlo methods. Due to the use of different terminologies and emphasis on different aspects of algorithmic performance there is a strong need for a more integrated view and opportunities for cross-fertilization across particular disciplines. These proceedings feature 20 original publications from distinguished authors in the cross-section of computational sciences, such as machine learning algorithms and probabilistic models, complex networks and fitness landscape analysis, set oriented numerics and cell mapping, evolutionary multiobjective optimization, diversity-oriented search, and the foundations of genetic programming algorithms. By presenting cutting edge results with a strong focus on foundations and integration aspects this work presents a stepping stone towards efficient, reliable, and well-analyzed methods for complex systems management and analysis.
Computational complexity -- Congresses. --- Computer science -- Congresses. --- Computer science. --- Engineering & Applied Sciences --- Computer Science --- Evolutionary computation --- Combinatorial optimization --- Engineering. --- Artificial intelligence. --- Computational intelligence. --- Intelligence, Computational --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Construction --- Computational Intelligence. --- Artificial Intelligence (incl. Robotics). --- Artificial intelligence --- Soft computing --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Industrial arts --- Technology --- Artificial Intelligence. --- Computational intelligence
Choose an application
Numerical analysis --- Computational complexity --- Complexité de calcul (Informatique) --- Analyse numérique --- Congresses --- Data processing --- Congrès --- Informatique --- -Numerical analysis --- -#TCPW P3.0 --- 681.3*F21 --- Mathematical analysis --- Complexity, Computational --- Electronic data processing --- Machine theory --- -Congresses --- Numerical algorithms and problems: computation of transforms; computations infinite fields; computations on matrices; computations on polynomials; numer-theoretic computations--See also {681.3*G1}; {681.3*G4}; {681.3*I1} --- 681.3*F21 Numerical algorithms and problems: computation of transforms; computations infinite fields; computations on matrices; computations on polynomials; numer-theoretic computations--See also {681.3*G1}; {681.3*G4}; {681.3*I1} --- #TCPW P3.0 --- Data processing&delete& --- Numerical analysis - Data processing - Congresses --- Computational complexity - Congresses
Listing 1 - 10 of 43 | << page >> |
Sort by
|