1277 search results - page 111 / 256 » Terminating Decision Algorithms Optimally |
118
Voted
NIPS
2007
15 years 4 months ago
2007
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
112
click to vote
ICRA
2007
IEEE
15 years 9 months ago
2007
IEEE
— While the Partially Observable Markov Decision Process (POMDP) provides a formal framework for the problem of robot control under uncertainty, it typically assumes a known and ...
132
Voted
IJCAI
2007
15 years 4 months ago
2007
Markov Decision Processes are a powerful framework for planning under uncertainty, but current algorithms have difficulties scaling to large problems. We present a novel probabil...
135
Voted
ISCI
2008
15 years 3 months ago
2008
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...
132
Voted
IPCO
2010
15 years 4 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...