Sciweavers

844 search results - page 155 / 169
» Generalized crowding for genetic algorithms
Sort
View
CP
2000
Springer
15 years 2 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
104
Voted
LCTRTS
2010
Springer
14 years 7 months ago
Improving both the performance benefits and speed of optimization phase sequence searches
The issues of compiler optimization phase ordering and selection present important challenges to compiler developers in several domains, and in particular to the speed, code size,...
Prasad A. Kulkarni, Michael R. Jantz, David B. Wha...
159
Voted
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
15 years 9 months ago
Genome-scale disk-based suffix tree indexing
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
Benjarath Phoophakdee, Mohammed J. Zaki
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
15 years 3 months ago
Effects of the use of non-geometric binary crossover on evolutionary multiobjective optimization
In the design of evolutionary multiobjective optimization (EMO) algorithms, it is important to strike a balance between diversity and convergence. Traditional mask-based crossover...
Hisao Ishibuchi, Yusuke Nojima, Noritaka Tsukamoto...
ECAL
1995
Springer
15 years 1 months ago
Contemporary Evolution Strategies
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...
Hans-Paul Schwefel, Günter Rudolph