Sciweavers

97 search results - page 9 / 20
» Learning against multiple opponents
Sort
View
GECCO
2003
Springer
133views Optimization» more  GECCO 2003»
14 years 2 months ago
Dynamic Strategies in a Real-Time Strategy Game
Abstract. Most modern real-time strategy computer games have a sophisticated but fixed ‘AI’ component that controls the computer’s actions. Once the user has learned how suc...
William Joseph Falke II, Peter Ross
ATAL
2006
Springer
14 years 22 days ago
Efficient agents for cliff-edge environments with a large set of decision options
This paper proposes an efficient agent for competing in Cliff Edge (CE) environments, such as sealed-bid auctions, dynamic pricing and the ultimatum game. The agent competes in on...
Ron Katz, Sarit Kraus
EWCBR
2008
Springer
13 years 10 months ago
Discovering Feature Weights for Feature-based Indexing of Q-tables
In this paper we propose an approach to address the old problem of identifying the feature conditions under which a gaming strategy can be effective. For doing this, we will build ...
Chad Hogg, Stephen Lee-Urban, Bryan Auslander, H&e...
AUSAI
2001
Springer
14 years 1 months ago
An Investigation of an Adaptive Poker Player
: Other work has shown that adaptive learning can be highly successful in developing programs which are able to play games at a level similar to human players and, in some cases, e...
Graham Kendall, Mark Willdig
CVIU
2004
115views more  CVIU 2004»
13 years 8 months ago
Dynamic learning from multiple examples for semantic object segmentation and search
We present a novel ``dynamic learning'' approach for an intelligent image database system to automatically improve object segmentation and labeling without user interven...
Yaowu Xu, Eli Saber, A. Murat Tekalp