216 search results - page 9 / 44 » The Complexity of Planning Problems With Simple Causal Graph... |
AGI
2011
12 years 11 months ago
2011
We present an actor-critic scheme for reinforcement learning in complex domains. The main contribution is to show that planning and I/O dynamics can be separated such that an intra...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
AAAI
2004
13 years 9 months ago
2004
Reactive planning using assumptions is a well-known approach to tackle complex planning problems for nondeterministic, partially observable domains. However, assumptions may be wr...
AIPS
2008
13 years 10 months ago
2008
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...