28 search results - page 4 / 6 » Complexity of Probabilistic Planning under Average Rewards |
MICCAI
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Automatic delineation and robust measurement of fetal anatomical structures in 2D ultrasound images is a challenging task due to the complexity of the object appearance, ...
ICCAD
2005
IEEE
15 years 6 months ago
2005
IEEE
Abstract — This paper describes a practical technique for the optimal scheduling of control dominated systems minimizing the weighted average latency over all control branches. S...
104
click to vote
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
104
click to vote
NIPS
2008
14 years 11 months ago
2008
Research in animal learning and behavioral neuroscience has distinguished between two forms of action control: a habit-based form, which relies on stored action values, and a goal...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...