Sciweavers

835 search results - page 116 / 167
» Dynamic populations in genetic algorithms
Sort
View
GECCO
2005
Springer
144views Optimization» more  GECCO 2005»
15 years 6 months ago
Multiobjective hBOA, clustering, and scalability
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominat...
Martin Pelikan, Kumara Sastry, David E. Goldberg
CEC
2005
IEEE
15 years 6 months ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...
117
Voted
EVOW
2006
Springer
15 years 4 months ago
The Effect of Building Block Construction on the Behavior of the GA in Dynamic Environments: A Case Study Using the Shaky Ladder
The shaky ladder hyperplane-defined functions (sl-hdf's) are a test suite utilized for exploring the behavior of the genetic algorithm (GA) in dynamic environments. We present...
William Rand, Rick L. Riolo
113
Voted
EVOW
2007
Springer
15 years 4 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...
AAAI
1998
15 years 1 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies