2150 search results - page 135 / 430 » On a restricted cross-intersection problem |
131
click to vote
IJFCS
2008
15 years 4 months ago
2008
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
165
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...
148
Voted
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 ...
242
click to vote
POPL
2003
ACM
16 years 5 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...
128
click to vote
AAAI
2007
15 years 7 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...