1971 search results - page 331 / 395 » Tabu search - Uncharted domains |
156
click to vote
AAAI
1998
15 years 7 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
180
click to vote
AAAI
2000
15 years 7 months ago
2000
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
138
click to vote
AIPS
2000
15 years 7 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
165
click to vote
NIPS
2000
15 years 7 months ago
2000
A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. As s...
166
click to vote
IJCAI
1997
15 years 7 months ago
1997
Because observing the same actions can warrant different conclusions depending on who executed the actions, a goal recognizer that works well on one person might not work well on ...