Sciweavers

2421 search results - page 428 / 485
» Approximate Flow-Aware Networking
Sort
View
IPPS
2000
IEEE
14 years 11 days ago
Reduction Optimization in Heterogeneous Cluster Environments
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
Pangfeng Liu, Da-Wei Wang
ATAL
2008
Springer
13 years 10 months ago
Decentralised coordination of low-power embedded devices using the max-sum algorithm
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
Alessandro Farinelli, Alex Rogers, Adrian Petcu, N...
WORM
2004
13 years 9 months ago
Preliminary results using scale-down to explore worm dynamics
A major challenge when attempting to analyze and model large-scale Internet phenomena such as the dynamics of global worm propagation is finding ate abstractions that allow us to ...
Nicholas Weaver, Ihab Hamadeh, George Kesidis, Ver...
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 9 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
ALMOB
2006
138views more  ALMOB 2006»
13 years 8 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh