We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
In current peer-to-peer file sharing networks, a large number of peers with heterogeneous connections simultaneously seek to download resources, e.g., files or file fragments, from...
We develop a new algorithm for isosurface extraction and view-dependent filtering from large time-varying fields, by using a novel Persistent Time-Octree (PTOT) indexing structure....
One of the major challenges facing a present day game development company is the removal of bugs from such complex virtual environments. This work presents an approach for measuri...
Instead of confining the player to a single role, the active participator model positions the player in a more flexible position towards the fictional gameworld: involved and imme...