1410 search results - page 134 / 282 » The Algorithmics of Solitaire-Like Games |
ICML
2003
IEEE
16 years 11 days ago
2003
IEEE
A satisfactory multiagent learning algorithm should, at a minimum, learn to play optimally against stationary opponents and converge to a Nash equilibrium in self-play. The algori...
AAAI
2008
15 years 1 months ago
2008
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...
103
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
— Multihoming is a popular method used by large enterprises and stub ISPs to connect to the Internet to reduce cost and improve performance. Recently researchers have studied the...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...