2924 search results - page 509 / 585 » Lower Bounds in Distributed Computing |
151
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
158
click to vote
WINE
2005
Springer
15 years 11 months ago
2005
Springer
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...
186
click to vote
ICPP
2006
IEEE
16 years 6 days ago
2006
IEEE
—Carrier sensing is a medium access method widely adopted in wireless communication to protect data transfers from interference. For example, Distributed Coordination Function (D...
181
click to vote
IPPS
2005
IEEE
15 years 11 months ago
2005
IEEE
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...
188
click to vote
MOBICOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...