159 search results - page 7 / 32 » Computing minimum cuts by randomized search heuristics |
123
click to vote
HEURISTICS
1998
15 years 1 days ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
111
click to vote
SMI
2006
IEEE
15 years 6 months ago
2006
IEEE
We present a novel approach for discretely optimizing contours on the surface of a triangle mesh. This is achieved through the use of a minimum ratio cycle (MRC) algorithm, where ...
110
Voted
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
96
Voted
SPIN
2004
Springer
15 years 5 months ago
2004
Springer
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
124
Voted
ICCAD
1999
IEEE
15 years 4 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...