Sciweavers

2924 search results - page 484 / 585
» Lower Bounds in Distributed Computing
Sort
View
ATAL
2009
Springer
15 years 11 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
IPPS
2007
IEEE
15 years 10 months ago
Topology-Transparent Duty Cycling for Wireless Sensor Networks
Our goal is to save energy in wireless sensor networks (WSNs) by periodic duty-cycling of sensor nodes. We schedule sensor nodes between active (transmit or receive) and sleep mod...
Yu Chen, Eric Fleury, Violet R. Syrotiuk
IPPS
2006
IEEE
15 years 10 months ago
Optimal map construction of an unknown torus
In this paper we consider the map construction problem in the case of an anonymous, unoriented torus of unknown size. An agent that can move from node to neighbouring node in the ...
Hanane Becha, Paola Flocchini
PDP
2005
IEEE
15 years 10 months ago
Practicable Layouts for Optimal Circulant Graphs
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
Enrique Vallejo, Ramón Beivide, Carmen Mart...
PODC
2005
ACM
15 years 10 months ago
Toward a theory of transactional contention managers
In recent software transactional memory proposals, a contention manager module is responsible for ensuring that the system as a whole makes progress. A number of contention manage...
Rachid Guerraoui, Maurice Herlihy, Bastian Pochon