4843 search results - page 342 / 969 » The Shortcut Problem - Complexity and Approximation |
130
click to vote
CCIA
2005
Springer
15 years 9 months ago
2005
Springer
— This paper proposes a high-level Reinforcement Learning (RL) control system for solving the action selection problem of an autonomous robot. Although the dominant approach, whe...
111
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We investigate the decidability of observational equivalence and approximation in “Syntactic Control of Interference” (SCI). By asg denotations of terms in an inequationally fu...
121
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— This work is concerned with the problem of characterizing and computing probabilistic bisimulations of diffusion processes. A probabilistic bisimulation relation between two su...
126
click to vote
NIPS
2008
15 years 5 months ago
2008
We show how improved sequences for magnetic resonance imaging can be found through optimization of Bayesian design scores. Combining approximate Bayesian inference and natural ima...
170
click to vote
AIPS
2006
15 years 5 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...