Sciweavers

6693 search results - page 18 / 1339
» On an anytime algorithm for control
Sort
View
AAAI
1998
13 years 9 months ago
Learning Investment Functions for Controlling the Utility of Control Knowledge
The utility problem occurs when the cost of the acquired knowledge outweighs its bene ts. When the learner acquires control knowledge for speeding up a problem solver, the bene t ...
Oleg Ledeniov, Shaul Markovitch
IJRR
2010
115views more  IJRR 2010»
13 years 5 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...
CIS
2004
Springer
14 years 1 months ago
Knowledge Maintenance on Data Streams with Concept Drifting
Concept drifting in data streams often occurs unpredictably at any time. Currently many classification mining algorithms deal with this problem by using an incremental learning ap...
Juggapong Natwichai, Xue Li
ICONIP
2009
13 years 5 months ago
A Markov Model for Multiagent Patrolling in Continuous Time
Abstract. We present a model for the multiagent patrolling problem with continuous-time. An anytime and online algorithm is then described and extended to asynchronous multiagent d...
Jean-Samuel Marier, Camille Besse, Brahim Chaib-dr...
UAI
1996
13 years 9 months ago
Some Experiments with Real-time Decision Algorithms
Real-time Decision algorithms are a class of incremental resource-bounded [Horvitz, 89] or anytime [Dean, 93] algorithms for evaluating influence diagrams. We present a test domai...
Bruce D'Ambrosio, Scott Burgess