914 search results - page 34 / 183 » The Computational Complexity of Probabilistic Planning |
AIPS
2008
15 years 6 months ago
2008
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...
225
click to vote
ICAART
2010
INSTICC
16 years 1 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
121
click to vote
EMSOFT
2006
Springer
15 years 7 months ago
2006
Springer
The paper deals with the problem of computing schedules for multi-threaded real-time programs. In [14] we introduced a scheduling method based on the geometrization of PV programs...
137
click to vote
CPC
1998
15 years 3 months ago
1998
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
139
click to vote
ICRA
2008
IEEE
15 years 10 months ago
2008
IEEE
— An important problem in position-based visual servoing (PBVS) is to guarantee that a target will remain within the field of view for the duration of the task. In this paper, w...