Sciweavers

13457 search results - page 134 / 2692
» Can we elect if we cannot compare
Sort
View
AIPS
2003
13 years 11 months ago
Localizing Planning with Functional Process Models
In this paper we describe a compromise between generative planning and special-purpose software. Hierarchical functional models are used by an intelligent system to represent its ...
J. William Murdock, Ashok K. Goel
COLT
2003
Springer
14 years 3 months ago
On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
John Case, Sanjay Jain, Franco Montagna, Giulia Si...
MFCS
2005
Springer
14 years 3 months ago
Interactive Algorithms 2005
A sequential algorithm just follows its instructions and thus cannot make a nondeterministic choice all by itself, but it can be instructed to solicit outside help to make a choic...
Yuri Gurevich
DSN
2004
IEEE
14 years 1 months ago
Fault Tolerant Computation on Ensemble Quantum Computers
In ensemble (or bulk) quantum computation, all computations are performed on an ensemble of computers rather than on a single computer. Measurements of qubits in an individual com...
P. Oscar Boykin, Vwani P. Roychowdhury, Tal Mor, F...
MOBICOM
2005
ACM
14 years 3 months ago
Abiding geocast: time--stable geocast for ad hoc networks
Abiding geocast is a time stable geocast delivered to all nodes that are inside a destination region within a certain period of time. Services like position–based advertising, p...
Christian Maihöfer, Tim Leinmüller, Elma...