Sciweavers

6437 search results - page 1 / 1288
» Parallel Algorithms for Arrangements
Sort
View
SPAA
1990
ACM
13 years 9 months ago
Parallel Algorithms for Arrangements
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...
Richard J. Anderson, Paul Beame, Erik Brisson
COMPGEOM
1991
ACM
13 years 9 months ago
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
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...
David Avis, Komei Fukuda
HPDC
2007
IEEE
13 years 12 months ago
Peer-to-peer checkpointing arrangement for mobile grid computing systems
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...
Paul J. Darby III, Nian-Feng Tzeng
GECCO
2005
Springer
149views Optimization» more  GECCO 2005»
13 years 11 months ago
Parallel genetic algorithms on line topology of heterogeneous computing resources
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...
Yiyuan Gong, Morikazu Nakamura, Shiro Tamaki
ASIAMS
2007
IEEE
14 years 9 hour ago
Broadcasting in (n, k)-Arrangement Graph Based on an Optimal Spanning Tree
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...
Jingli Li, Yonghong Xiang, Manli Chen, Yongheng Zh...