Sciweavers

840 search results - page 130 / 168
» The Complexity of the Extended GCD Problem
Sort
View
AAAI
2004
13 years 10 months ago
Generating Safe Assumption-Based Plans for Partially Observable, Nondeterministic Domains
Reactive planning using assumptions is a well-known approach to tackle complex planning problems for nondeterministic, partially observable domains. However, assumptions may be wr...
Alexandre Albore, Piergiorgio Bertoli
AAAI
2006
13 years 10 months ago
The Keystone Scavenger Team
Stereo vision for small mobile robots is a challenging problem, particularly when employing embedded systems with limited processing power. However, it holds the promise of greatl...
Jacky Baltes, John Anderson
FLAIRS
2004
13 years 10 months ago
A Functional and Behavioral Knowledge-based Implementation for Intelligent Sensors/Actuators
As the complexity of industrial processes increases, it requires the use of intelligent sensors or actuators (known as Intelligent Instruments) to allow for more comprehensive and...
Richard Dapoigny, Patrick Barlatier, Laurent Foull...
AAAI
1998
13 years 10 months ago
Bayesian Q-Learning
A central problem in learning in complex environmentsis balancing exploration of untested actions against exploitation of actions that are known to be good. The benefit of explora...
Richard Dearden, Nir Friedman, Stuart J. Russell
NC
1998
138views Neural Networks» more  NC 1998»
13 years 10 months ago
Parallel Adaptive Genetic Algorithm
In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is exte...
Leo Budin, Marin Golub, Domagoj Jakobovic