Sciweavers

472 search results - page 12 / 95
» Design of Iterated Local Search Algorithms
Sort
View
SBIA
2004
Springer
15 years 2 months ago
Detecting Promising Areas by Evolutionary Clustering Search
A challenge in hybrid evolutionary algorithms is to define efficient strategies to cover all search space, applying local search only in actually promising search areas. This pape...
Alexandre César Muniz de Oliveira, Luiz Ant...
78
Voted
DATE
2009
IEEE
118views Hardware» more  DATE 2009»
15 years 4 months ago
Gate sizing for large cell-based designs
—Today, many chips are designed with predefined discrete cell libraries. In this paper we present a new fast gate sizing algorithm that works natively with discrete cell choices...
Stephan Held
95
Voted
GECCO
2003
Springer
122views Optimization» more  GECCO 2003»
15 years 2 months ago
Designing A Hybrid Genetic Algorithm for the Linear Ordering Problem
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
Gaofeng Huang, Andrew Lim
RSFDGRC
1999
Springer
135views Data Mining» more  RSFDGRC 1999»
15 years 1 months ago
The Iterated Version Space Learning
Inspired with Version Space learning, the Iterated Version Space Algorithm (IVSA) has been designed and implemented to learn disjunctive concepts. IVSA dynamically partitions its s...
Jianna Jian Zhang, Nick Cercone
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
14 years 7 months ago
Beyond local optimality: An improved approach to hybrid model learning
Abstract-- Local convergence is a limitation of many optimization approaches for multimodal functions. For hybrid model learning, this can mean a compromise in accuracy. We develop...
Stephanie Gil, Brian Williams