Sciweavers

10901 search results - page 1775 / 2181
» Approximations in Distributed Optimization
Sort
View
SPAA
2006
ACM
16 years 24 days ago
Towards automatic parallelization of tree reductions in dynamic programming
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
CCGRID
2005
IEEE
16 years 14 days ago
Servicing range queries on multidimensional datasets with partial replicas
Partial replication is one type of optimization to speed up execution of queries submitted to large datasets. In partial replication, a portion of the dataset is extracted, re-org...
Li Weng, Ümit V. Çatalyürek, Tahs...
ICDCS
2005
IEEE
16 years 14 days ago
A Self-Organizing Lookup Service for Dynamic Ambient Services
The provisioning of Ambient Services is gaining importance as users become more and more embedded in environments that are saturated with electronic devices. In our previous work,...
Klaus Herrmann, Gero Mühl, Michael C. Jaeger
183
Voted
ICPP
2005
IEEE
16 years 13 days ago
An ACO-Based Approach for Scheduling Task Graphs with Communication Costs
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
Markus Bank, Udo Hönig, Wolfram Schiffmann
IPPS
2005
IEEE
16 years 13 days ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader
« Prev « First page 1775 / 2181 Last » Next »