2027 search results - page 106 / 406 » When is it best to best-respond |
80
Voted
UAI
2004
15 years 2 months ago
2004
We present a major improvement to the incremental pruning algorithm for solving partially observable Markov decision processes. Our technique targets the cross-sum step of the dyn...
AAAI
1998
15 years 2 months ago
1998
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
94
Voted
SERP
2003
15 years 2 months ago
2003
Abstract New algorithms are constantly developed in search of better or faster results. Many variants of code are often tried while searching for the best solution. When the number...
74
Voted
COLING
2000
15 years 2 months ago
2000
Automatic transliteration problem is to transcribe foreign words in one's own alphabet. Machine generated transliteration can be useful in various applications such as indexi...
79
Voted
ESANN
2000
15 years 2 months ago
2000
Abstract. This paper describes "cranking", a new committee formation algorithm. Cranking results in accurate and reliable committee predictions, even when applied to comp...