6105 search results - page 89 / 1221 » A Parallel Algorithm for Bound-Smoothing |
PPAM
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
ICPP
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NP ≤ n − ...
ICCSA
2004
Springer
15 years 3 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
IPL
2006
14 years 9 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
15 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...