2323 search results - page 116 / 465 » Power optimization for connectivity problems |
147
click to vote
DC
2010
15 years 2 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
133
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—A major problem in wireless networks is coping with limited resources, such as bandwidth and energy. These issues become a major algorithmic challenge in view of the dynamic nat...
127
Voted
ICAISC
2010
Springer
15 years 4 months ago
2010
Springer
The problem of finding optimal locations of base stations, their pilot powers and channel assignments in UMTS mobile networks belongs to a class of NP-hard problems, and hence, me...
118
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
102
Voted
MFCS
1994
Springer
15 years 6 months ago
1994
Springer
We show that the wavefront approach to Voronoi diagrams (a deterministic line sweep algorithm that does not use geometric transform) can be generalized to distance measures more g...