777 search results - page 145 / 156 » A fast algorithm for the computation of an upper bound on th... |
STACS
2010
Springer
14 years 3 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
JAIR
2008
13 years 8 months ago
2008
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...
SAC
2008
ACM
13 years 8 months ago
2008
ACM
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
CCCG
2008
13 years 10 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...