Sciweavers

3055 search results - page 68 / 611
» Randomized Search Trees
Sort
View
ECAI
2000
Springer
14 years 2 months ago
Local Search on Random 2+p-SAT
Josh Singer, Ian P. Gent, Alan Smaill
AIPS
1998
13 years 11 months ago
Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems
Westudytheruntimeprofilesofcompletebacktrackstylesearchmethodsappliedtohardschedulingproblems.Suchsearchmethodsoftenexhibita largevariabilityinperformanceduetothenon-standardnatur...
Carla P. Gomes, Bart Selman, Ken McAloon, Carol Tr...
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
13 years 11 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella