Sciweavers

7864 search results - page 1280 / 1573
» Clustering Genetic Algorithm
Sort
View
RECOMB
2010
Springer
15 years 11 months ago
The Clark Phase-able Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...
Bjarni V. Halldórsson, Derek Aguiar, Ryan T...
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
15 years 11 months ago
A stopping criterion based on Kalman estimation techniques with several progress indicators
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...
José Luis Guerrero, Jesús Garc&iacut...
CP
2000
Springer
15 years 9 months ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
EVOW
2007
Springer
15 years 8 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 8 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
« Prev « First page 1280 / 1573 Last » Next »