Sciweavers

454 search results - page 64 / 91
» On improving approximate solutions by evolutionary algorithm...
Sort
View
ALMOB
2008
92views more  ALMOB 2008»
15 years 1 months ago
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
Gang Wu, Ming-Yang Kao, Guohui Lin, Jia-Huai You
FM
2005
Springer
112views Formal Methods» more  FM 2005»
15 years 7 months ago
Dynamic Component Substitutability Analysis
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
Natasha Sharygina, Sagar Chaki, Edmund M. Clarke, ...
CEC
2007
IEEE
15 years 7 months ago
Graph design by graph grammar evolution
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
Martin H. Luerssen, David M. W. Powers
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 5 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
CP
2005
Springer
15 years 7 months ago
Mind the Gaps: A New Splitting Strategy for Consistency Techniques
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
Heikel Batnini, Claude Michel, Michel Rueher