159 search results - page 6 / 32 » Computing minimum cuts by randomized search heuristics |
ANOR
2007
15 years 15 days ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
106
click to vote
SPIN
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
118
click to vote
CPAIOR
2008
Springer
15 years 2 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
113
click to vote
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
108
click to vote
CLUSTER
2008
IEEE
15 years 6 months ago
2008
IEEE
—This paper describes the application of various search techniques to the problem of automatic empirical code optimization. The search process is a critical aspect of auto-tuning...