1310 search results - page 167 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
A new class of parallel normalized preconditioned conjugate gradient type methods in conjunction with normalized approximate inverses algorithms, based on normalized approximate f...
ICPPW
2006
IEEE
15 years 3 months ago
2006
IEEE
Many recent research efforts have been devoted to the use of commodity hardware for solving computationallyintensive scientific problems. Among such problems, hyperspectral imagi...
EUROPAR
1999
Springer
15 years 2 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...