Sciweavers

1615 search results - page 262 / 323
» Pathology in heuristic search
Sort
View
EVOW
2010
Springer
14 years 2 months ago
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
Günther R. Raidl, Bin Hu
CP
2009
Springer
14 years 2 months ago
Reasoning about Optimal Collections of Solutions
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
Tarik Hadzic, Alan Holland, Barry O'Sullivan
DATE
2009
IEEE
118views Hardware» more  DATE 2009»
14 years 2 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
WCRE
2009
IEEE
14 years 2 months ago
Automatic Package Coupling and Cycle Minimization
Abstract—Object-oriented (OO) software is usually organized into subsystems using the concepts of package or module. Such modular structure helps applications to evolve when faci...
Hani Abdeen, Stéphane Ducasse, Houari A. Sa...
ICDM
2009
IEEE
132views Data Mining» more  ICDM 2009»
14 years 2 months ago
Bayesian Overlapping Subspace Clustering
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
Qiang Fu, Arindam Banerjee