30 search results - page 4 / 6 » Computing and Using Lower and Upper Bounds for Action Elimin... |
UAI
2004
13 years 7 months ago
2004
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
BIBE
2005
IEEE
13 years 12 months ago
2005
IEEE
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
BIRTHDAY
2006
Springer
13 years 10 months ago
2006
Springer
Robots are autonomous agents whose actions are performed in the real world during a period of time. There are a number of general constraints on such actions, for example that the ...
ISVC
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...