Sciweavers

512 search results - page 80 / 103
» On Evolutionary Optimization of Large Problems Using Small P...
Sort
View
EDBT
2009
ACM
241views Database» more  EDBT 2009»
14 years 5 months ago
GADDI: distance index based subgraph matching in biological networks
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
Shijie Zhang, Shirong Li, Jiong Yang
GECCO
2009
Springer
14 years 5 months ago
The relationship between evolvability and bloat
Bloat is a common problem with Evolutionary Algorithms (EAs) that use variable length representation. By creating unnecessarily large individuals it results in longer EA runtimes ...
Jeffrey K. Bassett, Mark Coletti, Kenneth A. De Jo...
DAC
1994
ACM
14 years 2 months ago
Optimum Functional Decomposition Using Encoding
In this paper, we revisit the classical problem of functional decomposition [1, 2] that arises so often in logic synthesis. One basic problem that has remained largely unaddressed...
Rajeev Murgai, Robert K. Brayton, Alberto L. Sangi...
ICARIS
2010
Springer
13 years 8 months ago
An Information-Theoretic Approach for Clonal Selection Algorithms
In this research work a large set of the classical numerical functions were taken into account in order to understand both the search capability and the ability to escape from a lo...
Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone, ...
GLOBECOM
2006
IEEE
14 years 4 months ago
Connection Preemption in Multi-Class Networks
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
Fahad Rafique Dogar, Laeeq Aslam, Zartash Afzal Uz...