3455 search results - page 110 / 691 » Generalized Game Trees |
139
click to vote
SAGT
2010
Springer
15 years 2 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
143
click to vote
EDBT
2000
ACM
15 years 8 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
152
click to vote
ICML
2003
IEEE
16 years 5 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
133
click to vote
ECSQARU
2009
Springer
15 years 8 months ago
2009
Springer
The Transferable Belief Model is a powerful interpretation of belief function theory where decision making is based on the pignistic transform. Smets has proposed a generalization ...
120
click to vote
COCO
2008
Springer
15 years 6 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...