Søkt på: Søkeresultat
totalt 16 treff
A Graph-Theoretic Approach to Enterprise Network Dynamics
Networks have become nearly ubiquitous and increasingly complex, and their support of modern enterprise environments has become fundamental. Accordingly, robust network management …
Automata Theory and its Applications
The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching …
An Introduction to Quantum Computing Algorithms
In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the …
Bounded Queries in Recursion Theory
One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the …
Learning and Geometry: Computational Approaches
The field of computational learning theory arose out of the desire to for mally understand the process of learning. As potential applications to artificial intelligence became …
Logical Methods
The twenty-six papers in this volume reflect the wide and still expanding range of Anil Nerode's work. A conference on Logical Methods was held in honor of Nerode's sixtieth …
A Proof Theory for General Unification
In this monograph we study two generalizations of standard unification, E-unification and higher-order unification, using an abstract approach orig inated by Herbrand and …
Graph-Based Proof Procedures for Horn Clauses
The origins of this monograph lie in my Ph.D. dissertation of 1987 at the University of Pennsylvania, which was concerned with proof procedures for the Horn clause subset of logic. …
Feasible Mathematics
A so-called "effective" algorithm may require arbitrarily large finite amounts of time and space resources, and hence may not be practical in the real world. A "feasible" algorithm …
Notes on Introductory Combinatorics
In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. This was a great opportunity for me, as I had known of …
Real-Time Control of Walking
I wonder whether Karel Capek imagined in 1923 that by his use of the Czech word for forced labor, rohota, to name the android creations of Mr. Rossum he was naming an important …
Lecture Notes on Bucket Algorithms
Hashing algorithms scramble data and create pseudo-uniform data distribu- tions. Bucket algorithms operate on raw untransformed data which are parti- tioned Into groups according …