Sciweavers

6542 search results - page 358 / 1309
» The tao of parallelism in algorithms
Sort
View
PODC
2010
ACM
15 years 10 months ago
Brief announcement: exponential speed-up of local algorithms using non-local communication
We demonstrate how to leverage a system’s capability for allto-all communication to achieve an exponential speed-up of local algorithms despite bandwidth and memory restrictions...
Christoph Lenzen, Roger Wattenhofer
HPCC
2007
Springer
15 years 10 months ago
Energy-Aware Online Algorithm to Satisfy Sampling Rates with Guaranteed Probability for Sensor Applications
Abstract. Energy consumption is a major factor that limits the performance of sensor applications. Sensor nodes have varying sampling rates since they face continuously changing en...
Meikang Qiu, Edwin Hsing-Mean Sha
ESCIENCE
2006
IEEE
15 years 10 months ago
A Differential Evolution Based Algorithm to Optimize the Radio Network Design Problem
In this paper we present a Differential Evolution based algorithm used to solve the Radio Network Design (RND) problem. This problem consists in determining the optimal locations ...
Silvio Priem-Mendes, Juan Antonio Gómez Pul...
PARLE
1991
15 years 10 months ago
The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes
It is shown that the terminationdetection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the te...
Gerard Tel, Friedemann Mattern
PPSN
2010
Springer
15 years 5 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...