Sciweavers

315 search results - page 13 / 63
» A new heuristic to solve the one-warehouse N-retailer proble...
Sort
View
DAC
1996
ACM
14 years 23 days ago
Espresso-HF: A Heuristic Hazard-Free Minimizer for Two-Level Logic
-- We present a new heuristic algorithm for hazard-free minimization of two-level logic. On nearly all examples, the algorithm finds an exactly minimum-cost cover. It also solves s...
Michael Theobald, Steven M. Nowick, Tao Wu
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 2 months ago
A new evolutionary model for detecting multiple optima
Multimodal optimization problems consist in detecting all global and local optima of a problem. A new evolutionary approach to multimodal optimization called Roaming technique (RO...
Rodica Ioana Lung, D. Dumitrescu
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
13 years 9 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 2 months ago
CGP visits the Santa Fe trail: effects of heuristics on GP
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
Cezary Z. Janikow, Christopher J. Mann
HEURISTICS
1998
252views more  HEURISTICS 1998»
13 years 8 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley