1310 search results - page 109 / 262 » Progressive Optimization in Action |
134
click to vote
KR
1994
Springer
15 years 8 months ago
1994
Springer
Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensi...
129
click to vote
KR
1989
Springer
15 years 8 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
138
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
120
click to vote
ALT
2010
Springer
15 years 6 months ago
2010
Springer
We are studying long term sequence prediction (forecasting). We approach this by investigating criteria for choosing a compact useful state representation. The state is supposed t...
148
click to vote
DAGSTUHL
2007
15 years 6 months ago
2007
The ways in which an agent’s actions affect the world can often be modeled compactly using a set of relational probabilistic planning rules. This paper addresses the problem of ...