Sciweavers

230 search results - page 9 / 46
» UPPAAL-Tiga: Time for Playing Games!
Sort
View
CORR
2007
Springer
148views Education» more  CORR 2007»
13 years 7 months ago
Linear time algorithms for Clobber
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
Vincent D. Blondel, Julien M. Hendrickx, Raphael M...
GECCO
2003
Springer
133views Optimization» more  GECCO 2003»
14 years 18 days 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
IAT
2009
IEEE
14 years 2 months ago
Evaluating a Drama Management Approach in an Interactive Fiction Game
— In this paper, we evaluate a drama management approach deployed in an implementation of a graphical interactive fiction game. Our approach uses players’ feedback as a basis f...
Andrea Corradini, Manish Mehta, Santi Ontañ...
TARK
2009
Springer
14 years 1 months ago
Program equilibria and discounted computation time
Tennenholtz (GEB 2004) developed Program Equilibrium to model play in a finite twoplayer game where each player can base their strategy on the other player’s strategies. Tennen...
Lance Fortnow
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 1 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng