1410 search results - page 219 / 282 » The Algorithmics of Solitaire-Like Games |
117
Voted
STOC
1997
ACM
15 years 8 months ago
1997
ACM
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
135
click to vote
JAL
2006
15 years 3 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
153
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
131
Voted
AAAI
2006
15 years 5 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
159
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...