Sciweavers

38 search results - page 5 / 8
» Iterated local search with Powell's method: a memetic algori...
Sort
View
CP
2005
Springer
14 years 7 days ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
HEURISTICS
2008
120views more  HEURISTICS 2008»
13 years 6 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti
ALMOB
2006
155views more  ALMOB 2006»
13 years 6 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...
GECCO
2007
Springer
289views Optimization» more  GECCO 2007»
14 years 26 days ago
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan,...
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
14 years 26 days ago
Markov chain models of bare-bones particle swarm optimizers
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in an...
Riccardo Poli, William B. Langdon