Sciweavers

533 search results - page 46 / 107
» Playing games with approximation algorithms
Sort
View
IJCNN
2008
IEEE
14 years 2 months ago
Knowledge representation and acquisition for large-scale semantic memory
Abstract—Acquisition and representation of semantic concepts is a necessary requirement for the understanding of natural languages by cognitive systems. Word games provide an int...
Julian Szymanski, Wlodzislaw Duch
CDC
2010
IEEE
117views Control Systems» more  CDC 2010»
13 years 2 months ago
Distributed iterative regularization algorithms for monotone Nash games
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
Aswin Kannan, Uday V. Shanbhag
GECCO
2003
Springer
133views Optimization» more  GECCO 2003»
14 years 27 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
ACHI
2009
IEEE
13 years 11 months ago
SCRABBLE.GZ: A Web-Based Collaborative Game to Promote the Galician Language
We present in this paper a web-based version of a Scrabble game, describing its architecture and some implementation details. This architecture makes possible a high degree of int...
Guillermo de Bernardo, Ana Cerdeira-Pena, Oscar Pe...
SIGCSE
2002
ACM
126views Education» more  SIGCSE 2002»
13 years 7 months ago
Design patterns for games
Designing a two-person game involves identifying the game model to compute the best moves, the user interface (the "view") to play the game, and the controller to coordi...
Dung Zung Nguyen, Stephen B. Wong