638 search results - page 4 / 128 » A New Approach to Tractable Planning |
WOLLIC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We present a domain-independent algorithm for planning that computes macros in a novel way. Our algorithm computes macros “on-the-fly” for a given set of states and ...
DALT
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. In order to facilitate the development of agent-based software, several agent programming languages and architectures, have been created. Plans in these architectures are...
IJCAI
1997
14 years 11 months ago
1997
Tractable covers are introduced as a new ap proach to equivalence-preserving compilation of propositional knowledge bases. First, a gen eral framework is presented. Then, two ...
109
click to vote
JAIR
2006
14 years 9 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...
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
— By posing the problem of bandwidth allocation as a constrained maximization problem, it is possible to study various features of optimal bandwidth allocation, and hence the cap...