Sciweavers

1155 search results - page 95 / 231
» Continuous dynamic problem generators for evolutionary algor...
Sort
View
JCO
2007
123views more  JCO 2007»
15 years 15 days ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
PAMI
2010
168views more  PAMI 2010»
14 years 11 months ago
Dynamic Hybrid Algorithms for MAP Inference in Discrete MRFs
—In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRF...
Karteek Alahari, Pushmeet Kohli, Philip H. S. Torr
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
15 years 6 months ago
Promising infeasibility and multiple offspring incorporated to differential evolution for constrained optimization
In this paper, we incorporate a diversity mechanism to the differential evolution algorithm to solve constrained optimization problems without using a penalty function. The aim is...
Efrén Mezura-Montes, Jesús Vel&aacut...
134
Voted
BIOCOMP
2006
15 years 2 months ago
PAC: Progressive Alignment with Consensus Sequences
Computation of multiple sequence alignments is one of the major open problems in computational molecular biology. The purpose of this study was to provide a new method, PAC (Progre...
Ke Liu, Mansur H. Samadzadeh
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 6 months ago
SDR: a better trigger for adaptive variance scaling in normal EDAs
Recently, advances have been made in continuous, normal– distribution–based Estimation–of–Distribution Algorithms (EDAs) by scaling the variance up from the maximum–like...
Peter A. N. Bosman, Jörn Grahl, Franz Rothlau...