Sciweavers

48 search results - page 5 / 10
» Games solved: Now and in the future
Sort
View
AAAI
2008
13 years 10 months ago
Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...
Andrew Gilpin, Tuomas Sandholm
ICMCS
2007
IEEE
103views Multimedia» more  ICMCS 2007»
14 years 2 months ago
Multimedia Adaptive Computer based Testing: An Overview
Instead of computer games, animations, cartoons, and videos being used only for entertainment by kids, there is now an interest in using multimedia for “innovative testing.” R...
Anup Basu, Irene Cheng, Mun Prasad, Gautam Rao
DRM
2003
Springer
14 years 27 days ago
The IP war: apocalypse or revolution?
In the Foundation series, Asimov predicted a 1,000 years of darkness following the fall of the galactic empire. In the book Noir, K.W Jeter describes a world where IP is the ultim...
Tsvi Gal, Howard M. Singer, Laird Popkin
EVOW
2009
Springer
14 years 2 months ago
Dynamic Time-Linkage Problems Revisited
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
Trung Thanh Nguyen, Xin Yao
SIGCSE
1997
ACM
111views Education» more  SIGCSE 1997»
13 years 12 months ago
Teaching an engineering approach for network computing
Parallelism and concurrency have long been considered as non essential during the cursus of the average programmer. However, thanks to technological advances, new promising forms ...
Eric Dillon, Carlos Gamboa Dos Santos, Jacques Guy...