Sciweavers

12194 search results - page 426 / 2439
» Numberings Optimal for Learning
Sort
View
GPEM
2002
163views more  GPEM 2002»
15 years 6 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
201
Voted
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
16 years 1 months ago
An analysis of the effects of population structure on scalable multiobjective optimization problems
Multiobjective evolutionary algorithms (MOEA) are an effective tool for solving search and optimization problems containing several incommensurable and possibly conflicting objec...
Michael Kirley, Robert L. Stewart
GECCO
2010
Springer
188views Optimization» more  GECCO 2010»
15 years 10 months ago
Benchmarking real-coded genetic algorithm on noisy black-box optimization testbed
Originally, genetic algorithms were developed based on the binary representation of candidate solutions in which each conjectured solution is a fixed-length string of binary numb...
Thanh-Do Tran, Gang-Gyoo Jin
DSD
2010
IEEE
140views Hardware» more  DSD 2010»
15 years 7 months ago
Optimization of Area and Delay at Gate-Level in Multiple Constant Multiplications
—Although many efficient high-level algorithms have been proposed for the realization of Multiple Constant Multiplications (MCM) using the fewest number of addition and subtract...
Levent Aksoy, Eduardo Costa, Paulo F. Flores, Jos&...
AUTOMATICA
2010
94views more  AUTOMATICA 2010»
15 years 7 months ago
Optimality analysis of sensor-target localization geometries
The problem of target localization involves estimating the position of a target from multiple and typically noisy measurements of the target position. It is well known that the re...
Adrian N. Bishop, Baris Fidan, Brian D. O. Anderso...