66 search results - page 6 / 14 » Using Caching to Solve Larger Probabilistic Planning Problem... |
RAS
1998
14 years 11 months ago
1998
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....
109
click to vote
ICML
2009
IEEE
16 years 12 days ago
2009
IEEE
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
116
click to vote
JAIR
2008
14 years 11 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
107
click to vote
WWW
2003
ACM
16 years 8 days ago
2003
ACM
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...
ISCA
1993
IEEE
15 years 3 months ago
1993
IEEE
The distribution of resources among processors, memory and caches is a crucial question faced by designers of large-scale parallel machines. If a machine is to solve problems with...