20 search results - page 3 / 4 » Comparing global and local mutations on bit strings |
GECCO
2003
Springer
14 years 17 days ago
2003
Springer
A bit climber using a Gray encoding is guaranteed to converge to a global optimum in fewer than ¢¤£¦¥¨§© evaluations on unimodal 1-D functions and on multi-dimensional sph...
JHSN
2000
13 years 7 months ago
2000
A shaper is a system that stores incoming bits in a bu er and delivers them as early as possible, while forcing the output to be constrained with a given arrival curve. A shaper i...
IICAI
2003
13 years 8 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
JCB
2007
13 years 7 months ago
2007
Locality is an important and well-studied notion in comparative analysis of biological sequences. Similarly, taking into account affine gap penalties when calculating biological ...
ICMI
2000
Springer
13 years 11 months ago
2000
Springer
A system is proposed to recognize handwritten numerals in both Devnagri (Hindi) and English. It is assumed at a time the numerals will be of one of the above two scripts and there...