6437 search results - page 848 / 1288 » Parallel Algorithms for Arrangements |
184
click to vote
DASFAA
2004
IEEE
15 years 10 months ago
2004
IEEE
Abstract. Data declustering speeds up large data set retrieval by partitioning the data across multiple disks or sites and performing retrievals in parallel. Performance is determi...
157
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we develop a novel algorithm that allows service consumer agents to automatically select and provision service provider agents for their workflows in highly dynamic...
192
click to vote
CDES
2008
15 years 8 months ago
2008
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
176
click to vote
EOR
2008
15 years 7 months ago
2008
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
216
click to vote
GPEM
2002
15 years 6 months ago
2002
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...