Sciweavers

143 search results - page 4 / 29
» An Algorithm for Construction of Test Cases for the Quadrati...
Sort
View
CEC
2005
IEEE
14 years 1 months ago
Constraint quadratic approximation operator for treating equality constraints with genetic algorithms
Abstract- This paper presents a new operator for genetic algorithms that enhances their convergence in the case of nonlinear problems with nonlinear equality constraints. The propo...
Elizabeth F. Wanner, Frederico G. Guimarães...
LATIN
2010
Springer
13 years 6 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen
EOR
2007
147views more  EOR 2007»
13 years 7 months ago
Routing and wavelength assignment in optical networks using bin packing based algorithms
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the nu...
Nina Skorin-Kapov
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
13 years 7 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 7 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...