Sciweavers

356 search results - page 45 / 72
» Graph Games on Ordinals
Sort
View
SIROCCO
2000
14 years 11 months ago
On time versus size for monotone dynamic monopolies in regular topologies
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
Paola Flocchini, Rastislav Kralovic, Alessandro Ro...
SIGECOM
2008
ACM
122views ECommerce» more  SIGECOM 2008»
14 years 9 months ago
On the windfall of friendship: inoculation strategies on social networks
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...
Dominic Meier, Yvonne Anne Oswald, Stefan Schmid, ...
FSTTCS
1998
Springer
15 years 1 months ago
Partial Order Reductions for Bisimulation Checking
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
Michaela Huhn, Peter Niebert, Heike Wehrheim
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 4 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
IE
2007
14 years 11 months ago
Simulating sensory perception in 3D game characters
Extensive simulation of sensory perception for NPCs (Non Playing Characters) or bots in 3D games has been quite rare if not absent until recently. However, a few games have proven...
Fabio Zambetta