3455 search results - page 92 / 691 » Generalized Game Trees |
143
click to vote
ACG
2009
Springer
15 years 11 months ago
2009
Springer
With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the sear...
135
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
In large systems, it is important for agents to learn to act effectively, but sophisticated multi-agent learning algorithms generally do not scale. An alternative approach is to ...
146
click to vote
NETGAMES
2005
ACM
15 years 10 months ago
2005
ACM
Ranking is necessary for multiplayer online games to provide players with self-complacence and reference for choosing game counterparts. Most existing ranking solutions are tightl...
136
click to vote
SIGECOM
2010
ACM
15 years 9 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
137
click to vote
ISCIS
2009
Springer
15 years 9 months ago
2009
Springer
—We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree wi...