4894 search results - page 321 / 979 » Dynamic Abstraction Planning |
203
click to vote
ICDCS
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper considers a multi-query optimization issue for distributed similarity query processing, which attempts to exploit the dependencies in the derivation of a query evaluati...
165
click to vote
WECWIS
2006
IEEE
16 years 24 days ago
2006
IEEE
We present a dynamic and distributed approach to the hospital patient scheduling problem: the multi-agent Pareto-improvement appointment exchanging algorithm, MPAEX. It respects t...
176
click to vote
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 8 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
174
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
In this paper we study, for the first time explicitly, the implications of endowing an interested party (i.e. a teacher) with the ability to modify the underlying dynamics of the ...
172
Voted
STACS
2009
Springer
16 years 1 months ago
2009
Springer
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A w...