43 search results - page 1 / 9 » A Framework for Automatic Problem Decomposition in Planning |
AIPS
1994
13 years 6 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
TPDS
2002
13 years 4 months ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
ICRA
2010
IEEE
13 years 3 months ago
2010
IEEE
— Partially Observable Markov Decision Processes (POMDPs) offer a powerful mathematical framework for making optimal action choices in noisy and/or uncertain environments, in par...
LCPC
1997
Springer
13 years 9 months ago
1997
Springer
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
CDC
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— A geometric optimization based approach to deploy a mobile sensor network for the purpose of detecting and capturing mobile targets in the plane is presented in [1]. Th...