Sciweavers

2814 search results - page 362 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 11 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
VLDB
2004
ACM
119views Database» more  VLDB 2004»
14 years 10 months ago
Evaluating holistic aggregators efficiently for very large datasets
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
Lixin Fu, Sanguthevar Rajasekaran
GECCO
2008
Springer
257views Optimization» more  GECCO 2008»
13 years 11 months ago
Rapid evaluation and evolution of neural models using graphics card hardware
This paper compares three common evolutionary algorithms and our modified GA, a Distributed Adaptive Genetic Algorithm (DAGA). The optimal approach is sought to adapt, in near rea...
Thomas F. Clayton, Leena N. Patel, Gareth Leng, Al...
TIP
2010
111views more  TIP 2010»
13 years 5 months ago
Green Noise Digital Halftoning With Multiscale Error Diffusion
Multiscale error diffusion (MED) is superior to conventional error diffusion algorithms as it can eliminate directional hysteresis completely and possesses a good blue noise chara...
Yik-Hing Fung, Yuk-Hee Chan
TON
2010
126views more  TON 2010»
13 years 5 months ago
Cost-Effective Multiperiod Spraying for Routing in Delay-Tolerant Networks
In this paper, we present a novel multiperiod spraying algorithm for routing in delay-tolerant networks (DTNs). The goal is to minimize the average copy count used per message unti...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski