Sciweavers

134 search results - page 14 / 27
» On the Complexity of Computing Values of Restricted Games
Sort
View
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
14 years 1 months ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
SIGGRAPH
1998
ACM
13 years 12 months ago
Subdivision Surfaces in Character Animation
The creation of believable and endearing characters in computer graphics presents a number of technical challenges, including the modeling, animation and rendering of complex shap...
Tony DeRose, Michael Kass, Tien Truong
ATAL
2008
Springer
13 years 9 months ago
A tractable and expressive class of marginal contribution nets and its applications
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
13 years 11 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar
FUNGAMES
2010
13 years 8 months ago
ajME: making game engines autonomic
Autonomic Computing is now showing its value as a solution to the increased complexities of maintaining computer systems and has been applied to many different fields. In this pap...
Pedro Martins, Julie A. McCann