69,161 Result(s)
within
Chapter
**e **an
Algorithm Analysis and Problem Complexity
Artificial Intelligence
-
Chapter
Linear Adaptive Decision Functions and Their Application to Clinical Decision
In practice we are often forced to propose effective algorithm of decision, without having a desirable description of the situation, into which such an algorithm should be fitted, at our disposal. As the set o...
-
Chapter
Communication Complexity
The communication complexity of a function \(f:\{ 0, \cdots ,n - 1\} x\{ 0, \cdots ,n - 1\} \to \{ 0,1\}\) is the number of bits two per...
-
Chapter
Complete Representations for Learning from Examples
Valiant has previously defined what it means for F to be learnable from example by G, where F is a class of concepts and G a class of programs or representations. This chapter emphasizes that whether F is lear...
-
Chapter
Complexity of Random Problems
The notion of random problems has been introduced to capture the difficulty of modeling natural pattern recognition problems. These problems do not have a concise effective definition. We discuss the heuristic...
-
Chapter
Computational Information Theory
What is information? In a fundamental sense, Shannon’s definition of entropy captures the notion of information in situations where unlimited computing power is always available. As a result, in applications s...
-
Chapter
Introduction to Information-Based Complexity
Information-based complexity is based on three assumptions: information is partial, contaminated, and it costs. Its goal is to create a general theory about problems with such information, and to apply the res...
-
Chapter
Collective Computation, Content-Adressable Memory, and Optimization Problems
A collective decision network is described which can function as a computational element in a digital computer or signal processor. It differs from conventional digital circuit designs in emphasizing the large...
-
Chapter and Conference Paper
Consider only general superpositions in completion procedures
Superposition or critical pair computation is one of the key operations in the Knuth-Bendix completion procedure and its extensions. We propose a practical technique which can save computation of some critical...
-
Chapter and Conference Paper
Comtes — An experimental environment for the completion of term rewriting systems
-
Chapter and Conference Paper
Groebner bases in non-commutative algebras
-
Chapter and Conference Paper
An optimal algorithm for the boundary of a cell in a union of rays
In this paper, we study a cell of the subdivision induced by a union of n half lines (or rays) in the plane. We present two results. The first one is a novel proof of the O(n) bound on the number of edges of the ...
-
Chapter and Conference Paper
Equations in words
Makanin's algorithm [9], [3] decides whether an equation in words has a solution or not. The aim of this paper is to describe some new results in the field of solving equations in words.
-
Chapter and Conference Paper
Computing ground reducibility and inductively complete positions
We provide the extended ground-reducibility test which is essential for induction with term-rewriting systems based on [Küc89]: Given a term, determine at which sets of positions it is ground-reducible by whic...
-
Chapter and Conference Paper
KBlab: An equational theorem prover for the Macintosh
-
Chapter and Conference Paper
Experiments with a projection operator for algebraic decomposition
-
Chapter and Conference Paper
An algorithm for symbolic computation of center manifolds
A useful technique for the study of local bifurcations is the center manifold theory because a dimensional reduction is achieved. The computation of Taylor series approximations of center manifolds gives rise ...
-
Chapter and Conference Paper
Hamiltonian cycles in delaunay complexes
We restate a conjecture concerning the existence of Hamiltonian cycles in graphs resulting from the Delaunay triangulation of point sets in the plane R2. We introduce the notion of Delaunay complex, the natural c...
-
Chapter and Conference Paper
Geometric reasoning in motion planning
Automating the programming of assembly robots necessitates to develop methods for planning robot motions. In this paper we describe the geometric models and the reasoning techniques we have implemented as part...
-
Chapter and Conference Paper
Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction
The expressive power of logic programming may be achieved within a functional programming framework by extending the functional language with the ability to evaluate absolute set abstractions. By absolute set ...
-
Chapter and Conference Paper
Compilation of ground term rewriting systems and applications (DEMO)
