1277 search results - page 92 / 256 » Terminating Decision Algorithms Optimally |
118
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously diffic...
132
click to vote
AIEDAM
1998
15 years 3 months ago
1998
Gradient-based numerical optimization of complex engineering designs offers the promise of rapidly producing better designs. However, such methods generally assume that the object...
101
click to vote
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
— This paper presents an algorithmic framework for conducting search and identification missions using multiple heterogeneous agents. Dynamic objects of type “neutral” or ...
117
click to vote
WG
1998
Springer
15 years 7 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
137
Voted
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
We consider learning in a Markov decision process where we are not explicitly given a reward function, but where instead we can observe an expert demonstrating the task that we wa...