2181 search results - page 147 / 437 » The restriction scaffold problem |
164
click to vote
JAIR
2008
15 years 4 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...
146
click to vote
ISAAC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
237
click to vote
POPL
2003
ACM
16 years 4 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
127
click to vote
AAAI
2007
15 years 6 months ago
2007
Concurrent action execution is important for plan-length minimization. However, action specifications are often limited to avoid conflicts arising from precondition/effect inter...
114
click to vote
AIML
2004
15 years 5 months ago
2004
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...