159 search results - page 10 / 32 » Computing minimum cuts by randomized search heuristics |
111
click to vote
EAAI
2006
15 years 11 days ago
2006
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI ...
103
Voted
PPL
2000
15 years 4 days ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
116
Voted
AAAI
1996
15 years 1 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
118
click to vote
IRREGULAR
1995
Springer
15 years 3 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
114
click to vote
COR
2000
15 years 6 days ago
2000
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...