Sciweavers

1380 search results - page 59 / 276
» Computing the optimal strategy to commit to
Sort
View
AAAI
1994
13 years 9 months ago
Acting Optimally in Partially Observable Stochastic Domains
In this paper, we describe the partially observable Markov decision process pomdp approach to nding optimal or near-optimal control strategies for partially observable stochastic ...
Anthony R. Cassandra, Leslie Pack Kaelbling, Micha...
ATAL
2007
Springer
14 years 1 months ago
Reinforcement learning in extensive form games with incomplete information: the bargaining case study
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...
Alessandro Lazaric, Jose Enrique Munoz de Cote, Ni...
TCIAIG
2010
13 years 2 months ago
The Design of Puzzle Selection Strategies for ESP-Like GWAP Systems
The `Games With A Purpose' (GWAP) genre is a type of `Human Computation' that outsources certain steps of the computational process to humans. Although most GWAP studies ...
Ling-Jyh Chen, Bo-Chun Wang, Wen-Yuan Zhu
IEEEPACT
1999
IEEE
14 years 1 days ago
Predicated Static Single Assignment
Increases in instruction level parallelism are needed to exploit the potential parallelism available in future wide issue architectures. Predicated execution is an architectural m...
Lori Carter, Beth Simon, Brad Calder, Larry Carter...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani