Sciweavers

3780 search results - page 57 / 756
» Algorithms for Game Metrics
Sort
View
AAAI
1996
13 years 10 months ago
Forward Estimation for Game-Tree Search
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...
Weixiong Zhang
ML
1998
ACM
148views Machine Learning» more  ML 1998»
13 years 8 months ago
Colearning in Differential Games
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...
John W. Sheppard
ICPR
2008
IEEE
14 years 10 months ago
Fast and regularized local metric for query-based operations
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...
Frank P. Ferrie, Karim T. Abou-Moustafa
APPROX
2004
Springer
165views Algorithms» more  APPROX 2004»
14 years 2 months ago
Approximating Additive Distortion of Embeddings into Line Metrics
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 ...
Kedar Dhamdhere
IPCO
2010
125views Optimization» more  IPCO 2010»
13 years 10 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
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...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...