Sciweavers

25167 search results - page 4829 / 5034
» Parallel and Distributed Algorithms
Sort
View
GLOBECOM
2007
IEEE
16 years 25 days ago
Graph Theoretical Analysis of Opportunistic Scheduling Policy for Wireless Ad Hoc Networks
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Qing Chen, Fei Ye, Zhisheng Niu
INFOCOM
2007
IEEE
16 years 24 days ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
SECON
2007
IEEE
16 years 23 days ago
Coverage Problem for Sensors Embedded in Temperature Sensitive Environments
— The coverage and connectivity problem in sensor networks has received significant attention of the research community in the recent years. In this paper, we study this problem...
Arunabha Sen, Nibedita Das, Ling Zhou, Bao Hong Sh...
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
16 years 21 days ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
ATAL
2007
Springer
16 years 21 days ago
Effective tag mechanisms for evolving coordination
Tags or observable features shared by a group of similar agents are effectively used in real and artificial societies to signal intentions and can be used to infer unobservable ...
Matthew Matlock, Sandip Sen
« Prev « First page 4829 / 5034 Last » Next »