Sciweavers

250 search results - page 40 / 50
» General variable neighborhood search for the continuous opti...
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
14 years 11 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
CEC
2010
IEEE
15 years 24 days ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius
CF
2007
ACM
15 years 3 months ago
Parallel genomic sequence-search on a massively parallel system
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...
97
Voted
BMCBI
2006
123views more  BMCBI 2006»
14 years 11 months ago
Characterizing disease states from topological properties of transcriptional regulatory networks
Background: High throughput gene expression experiments yield large amounts of data that can augment our understanding of disease processes, in addition to classifying samples. He...
David Tuck, Harriet Kluger, Yuval Kluger
GECCO
2008
Springer
186views Optimization» more  GECCO 2008»
15 years 23 days ago
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...