159 search results - page 12 / 32 » Computing minimum cuts by randomized search heuristics |
69
Voted
HICSS
1997
IEEE
15 years 4 months ago
1997
IEEE
The value for decision making of high-quality postsolution analysis of decision-supporting models can hardly be overestimated. Candle-lighting analysis (CLA) takes this notion ver...
115
Voted
IJHIS
2007
15 years 9 days ago
2007
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
116
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
125
Voted
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
113
Voted
CPHYSICS
2006
15 years 12 days ago
2006
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...