Sciweavers

133 search results - page 16 / 27
» Sequential Decision Making Under Uncertainty
Sort
View
IAT
2009
IEEE
15 years 8 months ago
Introducing Communication in Dis-POMDPs with Finite State Machines
Distributed Partially Observable Markov Decision Problems (DisPOMDPs) are emerging as a popular approach for modeling sequential decision making in teams operating under uncertain...
Yuki Iwanari, Makoto Tasaki, Makoto Yokoo, Atsushi...
EMO
2009
Springer
174views Optimization» more  EMO 2009»
15 years 8 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck
120
Voted
QRE
2010
129views more  QRE 2010»
15 years 8 days ago
Improving quality of prediction in highly dynamic environments using approximate dynamic programming
In many applications, decision making under uncertainty often involves two steps- prediction of a certain quality parameter or indicator of the system under study and the subseque...
Rajesh Ganesan, Poornima Balakrishna, Lance Sherry
140
Voted
AI
2002
Springer
15 years 1 months ago
Using similarity criteria to make issue trade-offs in automated negotiations
Automated negotiation is a key form of interaction in systems that are composed of multiple autonomous agents. The aim of such interactions is to reach agreements through an itera...
Peyman Faratin, Carles Sierra, Nicholas R. Jenning...
CPAIOR
2008
Springer
15 years 3 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck