Sciweavers

35 search results - page 3 / 7
» Rediscovering *-Minimax Search
Sort
View
AAAI
2012
11 years 8 months ago
Sequential Decision Making with Rank Dependent Utility: A Minimax Regret Approach
This paper is devoted to sequential decision making with Rank Dependent expected Utility (RDU). This decision criterion generalizes Expected Utility and enables to model a wider r...
Gildas Jeantet, Patrice Perny, Olivier Spanjaard
TIP
1998
129views more  TIP 1998»
13 years 5 months ago
Minimax partial distortion competitive learning for optimal codebook design
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
Ce Zhu, Lai-Man Po
CG
2000
Springer
13 years 10 months ago
Lambda-Search in Game Trees - with Application to Go
This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
Thomas Thomsen
AI
1998
Springer
13 years 5 months ago
Pruning Algorithms for Multi-Model Adversary Search
The Multi-model search framework generalizes minimax to allow exploitation of recursive opponent models. In this work we consider adding pruning to the multi-model search. We prov...
David Carmel, Shaul Markovitch
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
14 years 5 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng