Sciweavers

5 search results - page 1 / 1
» New Approximate Strategies for Playing Sum Games based on Su...
Sort
View
ICGA
2006
312views Optimization» more  ICGA 2006»
15 years 8 months ago
New Approximate Strategies for Playing Sum Games based on Subgame Types
In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
Manal Zaky, Cherif Salama, Salma Ghoneim
CG
2006
Springer
14 years 7 days ago
Comparative Study of Approximate Strategies for Playing Sum Games Based on Subgame Types
Cherif R. S. Andraos, Manal M. Zaky, Salma A. Ghon...
AAAI
2004
13 years 10 months ago
Temperature Discovery Search
Temperature Discovery Search (TDS) is a new minimaxbased game tree search method designed to compute or approximate the temperature of a combinatorial game. TDS is based on the co...
Martin Müller 0003, Markus Enzenberger, Jonat...
IJCAI
2007
13 years 10 months ago
Transfer Learning in Real-Time Strategy Games Using Hybrid CBR/RL
The goal of transfer learning is to use the knowledge acquired in a set of source tasks to improve performance in a related but previously unseen target task. In this paper, we pr...
Manu Sharma, Michael P. Holmes, Juan Carlos Santam...
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 6 months ago
Stochastic Budget Optimization in Internet Advertising
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the adve...
Bhaskar DasGupta, S. Muthukrishnan