Sciweavers

81 search results - page 10 / 17
» Distance d-Domination Games
Sort
View
EJWCN
2010
229views more  EJWCN 2010»
13 years 3 months ago
Throughput-Efficient Dynamic Coalition Formation in Distributed Cognitive Radio Networks
We formulate the problem of distributed throughput-efficient sensing in cognitive radio (CR) networks as a dynamic coalition formation game based on a Markovian model. The propose...
Zaheer Khan, Janne J. Lehtomäki, Marian Codre...
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
12 years 8 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
NETGAMES
2004
ACM
14 years 2 months ago
Accuracy in dead-reckoning based distributed multi-player games
Distributed multi-player games use dead reckoning vectors to intimate other (at a distance) participating players about the movement of any entity by a controlling player. The dea...
Sudhir Aggarwal, Hemant Banavar, Amit Khandelwal, ...
SPAA
2010
ACM
14 years 1 months ago
Basic network creation games
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
Noga Alon, Erik D. Demaine, MohammadTaghi Hajiagha...
SG
2009
Springer
14 years 3 months ago
Sketch-Based Interface for Crowd Animation
In this paper, we propose a novel interface for controlling crowd animation. Crowd animation is widely used in movie production and computer games. However, to make an intended cro...
Masaki Oshita, Yusuke Ogiwara