6437 search results - page 1 / 1288 » Parallel Algorithms for Arrangements |
70
Voted
SPAA
1990
ACM
15 years 2 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
82
Voted
COMPGEOM
1991
ACM
15 years 1 months ago
1991
ACM
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
105
click to vote
HPDC
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper deals with a novel, distributed, QoS-aware, peer-topeer checkpointing arrangement component for mobile Grid (MoG) computing systems middleware. Checkpointing is more cr...
80
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper evaluates a parallel genetic algorithm (GA) on the line topology of heterogeneous computing resources. Evolution process of parallel GAs is investigated on two types of...
88
Voted
ASIAMS
2007
IEEE
15 years 4 months ago
2007
IEEE
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...