Sciweavers

928 search results - page 2 / 186
» Evolutionary algorithms and matroid optimization problems
Sort
View
JUCS
2007
105views more  JUCS 2007»
13 years 7 months ago
Graded Sparse Graphs and Matroids
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
Audrey Lee, Ileana Streinu, Louis Theran
FOCS
2009
IEEE
14 years 2 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
14 years 1 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 8 months ago
A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...
Parvaz Mahdabi, Saeed Jalili, Mahdi Abadi