Sciweavers

883 search results - page 72 / 177
» A Genetic Algorithm Applied to the Maximum Flow Problem
Sort
View
GECCO
2009
Springer
113views Optimization» more  GECCO 2009»
15 years 7 months ago
Variable size population for dynamic optimization with genetic programming
A new model of Genetic Programming with variable size population is presented in this paper and applied to the reconstruction of target functions in dynamic environments (i.e. pro...
Leonardo Vanneschi, Giuseppe Cuccu
103
Voted
ICCAD
1994
IEEE
151views Hardware» more  ICCAD 1994»
15 years 6 months ago
Multi-way VLSI circuit partitioning based on dual net representation
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a new dual netlist representation named the hybrid dual netlist (HDN), and propo...
Jason Cong, Wilburt Labio, Narayanan Shivakumar
139
Voted
ICCV
2003
IEEE
16 years 4 months ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu
IDA
2008
Springer
15 years 2 months ago
A comprehensive analysis of hyper-heuristics
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
Ender Özcan, Burak Bilgin, Emin Erkan Korkmaz
117
Voted
TCS
2008
15 years 2 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman