Sciweavers

106 search results - page 19 / 22
» Connectivity and Equilibrium in Random Games
Sort
View
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
14 years 4 days ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...
SODA
2000
ACM
122views Algorithms» more  SODA 2000»
13 years 8 months ago
Cooperative facility location games
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
Michel X. Goemans, Martin Skutella
ICASSP
2009
IEEE
14 years 2 months ago
Cheat-proof cooperation strategies for wireless live streaming social networks
Multimedia social network analysis is an emerging research area, which analyzes the behavior of users who share multimedia content and investigates the impact of human dynamics on...
W. Sabrina Lin, H. Vicky Zhao, K. J. Ray Liu
INFOCOM
2007
IEEE
14 years 1 months ago
Malicious Users in Unstructured Networks
—Unstructured networks (like ad-hoc or peer-to-peer networks) are networks without centralized control of their operation. Users make local decisions regarding whether to follow ...
George Theodorakopoulos, John S. Baras
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 7 months ago
Occupancy distributions of homogeneous queueing systems under opportunistic scheduling
This paper analyzes opportunistic schemes for transmission scheduling from one of n homogeneous queues whose channel states fluctuate independently. Considered schemes consist of ...
Murat Alanyali, Maxim Dashouk