226 search results - page 33 / 46 » Heuristic Search Planning with BDDs |
101
click to vote
AIPS
2010
14 years 12 months ago
2010
We present a planning domain that encodes the problem of generating natural language sentences. This domain has a number of features that provoke fairly unusual behavior in planne...
121
click to vote
JAIR
2006
14 years 11 months ago
2006
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
119
Voted
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...
ICTAI
2005
IEEE
15 years 5 months ago
2005
IEEE
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
107
click to vote
AIPS
2003
15 years 1 months ago
2003
Grid computing gives users access to widely distributed networks of computing resources to solve large-scale tasks such as scientific computation. These tasks are defined as stand...