Sciweavers

153 search results - page 29 / 31
» Player adaptive entertainment computing
Sort
View
NOSSDAV
2004
Springer
14 years 1 months ago
Low latency and cheat-proof event ordering for peer-to-peer games
We are developing a distributed architecture for massivelymultiplayer games. In this paper, we focus on designing a low-latency event ordering protocol, called NEO, for this archi...
Chris GauthierDickey, Daniel Zappala, Virginia Mar...
IDMS
1999
Springer
117views Multimedia» more  IDMS 1999»
14 years 24 days ago
Tailoring Protocols for Dynamic Network Conditions and User Requirements
This paper shows the use of protocols dynamically generated for a particular network environment and an application’s requirements. We have developed a novel system called PNUT (...
R. De Silva, Aruna Seneviratne
FSTTCS
2008
Springer
13 years 9 months ago
Graph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
Julien Cristau, Florian Horn
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 8 months ago
Is It Real, or Is It Randomized?: A Financial Turing Test
We construct a financial "Turing test" to determine whether human subjects can differentiate between actual vs. randomized financial returns. The experiment consists of ...
Jasmina Hasanhodzic, Andrew W. Lo, Emanuele Viola
ICGA
2006
128views Optimization» more  ICGA 2006»
13 years 8 months ago
Never-Ending Moves in Bao
Bao is a member of the large family of mancala games. It is generally considered to be the most complex mancala game with respect to the number of game rules (Townshend, 1986; De ...
Tom Kronenburg, H. H. L. M. Donkers, Alex J. de Vo...