Sciweavers

3049 search results - page 297 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
179
Voted
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
16 years 2 days ago
Search space modulation in genetic algorithms: evolving the search space by sinusoidal transformations
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
José Antonio Martin H.
CORR
2004
Springer
168views Education» more  CORR 2004»
15 years 6 months ago
Estimating Genome Reversal Distance by Genetic Algorithm
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
Andy Auyeung, Ajith Abraham
IJCGA
2002
73views more  IJCGA 2002»
15 years 6 months ago
A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
Alexander Wolff, Michael Thon, Yin-Feng Xu
IJACTAICIT
2010
189views more  IJACTAICIT 2010»
15 years 3 months ago
An Improved Algorithm for Data Hiding Using HH-subband Haar Wavelet Coefficients
This paper presents an improved adaptive algorithm for enhanced data hiding under HH-subband Haar Wavelet coefficients of a gray scale host image. The algorithm uses an optimal se...
Stuti Bazaj, Sachin Modi, Anand Mohan, S. P. Singh
ICCAD
2005
IEEE
98views Hardware» more  ICCAD 2005»
16 years 3 months ago
Clustering for processing rate optimization
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
Chuan Lin, Jia Wang, Hai Zhou