Sciweavers

4435 search results - page 58 / 887
» Algorithms, games, and the internet
Sort
View
AAAI
1996
13 years 11 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 9 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
IPCO
2010
125views Optimization» more  IPCO 2010»
13 years 11 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...
ATAL
2007
Springer
14 years 4 months ago
Policy recognition for multi-player tactical scenarios
This paper addresses the problem of recognizing policies given logs of battle scenarios from multi-player games. The ability to identify individual and team policies from observat...
Gita Sukthankar, Katia P. Sycara
CHI
2011
ACM
13 years 1 months ago
Target assistance for subtly balancing competitive play
In games where skills such as targeting are critical to winning, it is difficult for players with different skill levels to have a competitive and engaging experience. Although se...
Scott Bateman, Regan L. Mandryk, Tadeusz Stach, Ca...