Sciweavers

6897 search results - page 704 / 1380
» Parallelization of Modular Algorithms
Sort
View
CIKM
2001
Springer
15 years 11 months ago
Joint Optimization of Cost and Coverage of Query Plans in Data Integration
Existing approaches for optimizing queries in data integration use decoupled strategies–attempting to optimize coverage and cost in two separate phases. Since sources tend to ha...
Zaiqing Nie, Subbarao Kambhampati
180
Voted
CCCG
2010
15 years 8 months ago
I/O-efficient triangular range search and its application
In this paper, we consider a special type of triangular range search for a planar point set S in the I/O-model. Here, two sides of the query triangle are parallel to the coordinat...
Gautam K. Das, Bradford G. Nickerson
EOR
2008
52views more  EOR 2008»
15 years 7 months ago
Competitive online scheduling of perfectly malleable jobs with setup times
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
Jessen T. Havill, Weizhen Mao
CLUSTER
2006
IEEE
15 years 7 months ago
A taxonomy of application scheduling tools for high performance cluster computing
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
Jiannong Cao, Alvin T. S. Chan, Yudong Sun, Sajal ...
PODC
2009
ACM
16 years 7 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer