Sciweavers

97 search results - page 8 / 20
» Simple optimization techniques for A*-based search
Sort
View
GECCO
2004
Springer
122views Optimization» more  GECCO 2004»
14 years 25 days ago
An Improved Diversity Mechanism for Solving Constrained Optimization Problems Using a Multimembered Evolution Strategy
This paper presents an improved version of a simple evolution strategy (SES) to solve global nonlinear optimization problems. As its previous version, the approach does not require...
Efrén Mezura-Montes, Carlos A. Coello Coell...
VLDB
2001
ACM
66views Database» more  VLDB 2001»
13 years 12 months ago
An Evaluation of Generic Bulk Loading Techniques
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...
Jochen Van den Bercken, Bernhard Seeger
VTC
2006
IEEE
103views Communications» more  VTC 2006»
14 years 1 months ago
Codeword Length Optimization for CPPUWB Systems
— The optimal codeword length that generates the maximum output signal to interference ratio (SIR) for the channel-phase-precoded ultra-wideband (CPPUWB) system proposed in [1] i...
Yu-Hao Chang, Shang-Ho Tsai, Xiaoli Yu, C. C. Jay ...
EVOW
2008
Springer
13 years 9 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
14 years 29 days ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...