Sciweavers

1277 search results - page 79 / 256
» Terminating Decision Algorithms Optimally
Sort
View
ICML
2003
IEEE
16 years 4 months ago
The Cross Entropy Method for Fast Policy Search
We present a learning framework for Markovian decision processes that is based on optimization in the policy space. Instead of using relatively slow gradient-based optimization al...
Shie Mannor, Reuven Y. Rubinstein, Yohai Gat
ATAL
2009
Springer
15 years 9 months ago
Achieving goals in decentralized POMDPs
Coordination of multiple agents under uncertainty in the decentralized POMDP model is known to be NEXP-complete, even when the agents have a joint set of goals. Nevertheless, we s...
Christopher Amato, Shlomo Zilberstein
ISAAC
1999
Springer
107views Algorithms» more  ISAAC 1999»
15 years 7 months ago
Carrying Umbrellas: An Online Relocation Problem on Graphs
We introduce an online relocation problem on a graph, in which a player who walks around the nodes makes decisions on whether to relocate mobile resources, while not knowing the fu...
Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa
CCE
2004
15 years 3 months ago
Optimization under uncertainty: state-of-the-art and opportunities
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...
Nikolaos V. Sahinidis
92
Voted
PPSN
2004
Springer
15 years 8 months ago
Finding Knees in Multi-objective Optimization
Abstract. Many real-world optimization problems have several, usually conflicting objectives. Evolutionary multi-objective optimization usually solves this predicament by searchin...
Jürgen Branke, Kalyanmoy Deb, Henning Dierolf...