937 search results - page 111 / 188 » Hybrid Evolutionary Algorithm for Solving Global Optimizatio... |
EVOW
2007
Springer
14 years 3 months ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
PROCEDIA
2011
12 years 12 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
In this work, we explore the idea that parameter setting of stochastic metaheuristics should be considered as a multiobjective problem. The so-called “performance fronts” pres...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. The problem often is multi-modal and therefore appropriate optimi...
CPAIOR
2006
Springer
14 years 26 days ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...