2084 search results - page 182 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
131
Voted
DCOSS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
129
Voted
TCS
2008
15 years 2 months ago
2008
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
124
Voted
IPPS
2010
IEEE
15 years 17 days ago
2010
IEEE
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
123
Voted
ISLPED
2007
ACM
15 years 4 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
123
Voted
WDAG
2010
Springer
15 years 1 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...