3780 search results - page 57 / 756 » Algorithms for Game Metrics |
116
Voted
AAAI
1996
15 years 1 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
123
Voted
ML
1998
ACM
15 years 6 days ago
1998
ACM
Game playing has been a popular problem area for research in artificial intelligence and machine learning for many years. In almost every study of game playing and machine learnin...
86
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
To learn a metric for query?based operations, we combine the concept underlying manifold learning algorithms and the minimum volume ellipsoid metric in a unified algorithm to find...
APPROX
2004
Springer
15 years 6 months ago
2004
Springer
We consider the problem of fitting metric data on n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive ...
108
Voted
IPCO
2010
15 years 2 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...