Sciweavers

1503 search results - page 185 / 301
» Generalized Parity Games
Sort
View
CG
2002
Springer
15 years 1 months ago
A Structure for Modern Computer Narratives
In order to analyze or better develop modern computer games it is critical to have an appropriate representation framework. In this paper a symbolic representation of modern comput...
Clark Verbrugge
SOSP
2005
ACM
15 years 10 months ago
IRON file systems
Commodity file systems trust disks to either work or fail completely, yet modern disks exhibit more complex failure modes. We suggest a new fail-partial failure model for disks, ...
Vijayan Prabhakaran, Lakshmi N. Bairavasundaram, N...
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 8 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
CEC
2009
IEEE
15 years 8 months ago
Robust player imitation using multiobjective evolution
— The problem of how to create NPC AI for videogames that believably imitates particular human players is addressed. Previous approaches to learning player behaviour is found to ...
Niels van Hoorn, Julian Togelius, Daan Wierstra, J...
GECCO
2009
Springer
200views Optimization» more  GECCO 2009»
15 years 8 months ago
Apply ant colony optimization to Tetris
Tetris is a falling block game where the player’s objective is to arrange a sequence of different shaped tetrominoes smoothly in order to survive. In the intelligence games, ag...
Xingguo Chen, Hao Wang, Weiwei Wang, Yinghuan Shi,...