6437 search results - page 70 / 1288 » Parallel Algorithms for Arrangements |
IPL
2006
13 years 10 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
ICPP
1994
IEEE
14 years 2 months ago
1994
IEEE
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data i.e., Bu...
CCCG
2009
13 years 11 months ago
2009
In this paper, we present new algorithms for computing maximum perimeter and maximum area of the convex hull of imprecise inputs based on the parallel line segment model. The runn...
INFORMATICALT
1998
13 years 9 months ago
1998
This paper presents a parallel version of a Generalized Conjugate Gradient algorithm proposed by Liu and Story in which the search direction considers the effect of the inexact lin...