Sciweavers

982 search results - page 91 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
107
Voted
SLS
2009
Springer
243views Algorithms» more  SLS 2009»
15 years 7 months ago
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
92
Voted
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
15 years 4 months ago
A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
Shouichi Matsui, Ken-ichi Tokoro
81
Voted
ECCV
2006
Springer
16 years 2 months ago
Fast, Quality, Segmentation of Large Volumes - Isoperimetric Distance Trees
For many medical segmentation tasks, the contrast along most of the boundary of the target object is high, allowing simple thresholding or region growing approaches to provide near...
Leo Grady
99
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
GECCO
2007
Springer
129views Optimization» more  GECCO 2007»
15 years 6 months ago
Procreating V-detectors for nonself recognition: an application to anomaly detection in power systems
The artificial immune system approach for self-nonself discrimination and its application to anomaly detection problems in engineering is showing great promise. A seminal contribu...
Min Gui, Sanjoy Das, Anil Pahwa