Sciweavers

1599 search results - page 58 / 320
» Algorithms for Parity Games
Sort
View
AAAI
1996
15 years 21 days 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»
14 years 11 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
ATAL
2007
Springer
15 years 5 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
14 years 3 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...
TC
2008
14 years 11 months ago
Exploiting In-Memory and On-Disk Redundancy to Conserve Energy in Storage Systems
Abstract--Today's storage systems place an imperative demand on energy efficiency. A storage system often places single-rotationrate disks into standby mode by stopping them f...
Jun Wang, Xiaoyu Yao, Huijun Zhu