800 search results - page 63 / 160 » On the Complexity of Parity Games |
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
In many complex multi-agent domains it is impractical to compute exact analytic solutions. An alternate means of analysis applies computational tools to derive and analyze empiric...
ML
1998
ACM
13 years 8 months ago
1998
ACM
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
SIGCSE
2009
ACM
14 years 9 months ago
2009
ACM
Complex distributed systems are increasingly important in modern computer science, yet many undergraduate curricula do not give students the opportunity to develop the skill sets ...
AIIDE
2008
13 years 11 months ago
2008
It is difficult to discover effective behavior for NPCs automatically. For instance, evolutionary methods can learn sophisticated behaviors based on a single objective, but realis...
SIGCSE
1998
ACM
14 years 1 months ago
1998
ACM
Most people enjoy playing games. Most CS-1 students will enjoy a final project that involves computational game-playing. Chance-It is a simple two-person dice game with many possi...