262 search results - page 41 / 53 » Analyzing Computer Game Narratives |
100
click to vote
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
We analyze a heads-up no-limit Texas Hold’em poker tournament with a fixed small blind of 300 chips, a fixed big blind of 600 chips and a total amount of 8000 chips on the tab...
SKG
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we explore the market-based grid resource trading system from the social perspective and the collaborative computing perspective. We firstly introduce a novel fram...
106
Voted
PODC
2009
ACM
15 years 10 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
ICTAC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output mode...