Sciweavers

1019 search results - page 3 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
DSN
2005
IEEE
13 years 11 months ago
Perturbation-Resistant and Overlay-Independent Resource Discovery
This paper realizes techniques supporting the position that strategies for resource location and discovery in distributed systems should be both perturbation-resistant and overlay...
Steven Y. Ko, Indranil Gupta
TJS
2008
78views more  TJS 2008»
13 years 5 months ago
A performance study of multiprocessor task scheduling algorithms
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
Shiyuan Jin, Guy A. Schiavone, Damla Turgut
JACM
2006
98views more  JACM 2006»
13 years 5 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
KDD
2005
ACM
182views Data Mining» more  KDD 2005»
14 years 5 months ago
Making holistic schema matching robust: an ensemble approach
The Web has been rapidly "deepened" by myriad searchable databases online, where data are hidden behind query interfaces. As an essential task toward integrating these m...
Bin He, Kevin Chen-Chuan Chang
EC
2007
167views ECommerce» more  EC 2007»
13 years 5 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud