Sciweavers

548 search results - page 63 / 110
» Using the Genetic Algorithm to Find Snake-in-the-Box Codes
Sort
View
WCET
2010
13 years 6 months ago
A Code Policy Guaranteeing Fully Automated Path Analysis
Calculating the worst-case execution time (WCET) of real-time tasks is still a tedious job. Programmers are required to provide additional information on the program flow, analyzi...
Benedikt Huber, Peter P. Puschner
EOR
2010
104views more  EOR 2010»
13 years 6 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
EVOW
2006
Springer
14 years 19 days ago
Evolutionary Singularity Filter Bank Optimization for Fingerprint Image Enhancement
Singularity is the special feature of fingerprints for identification and classification. Since the performance of singularity extraction depends on the quality of fingerprint imag...
Ung-Keun Cho, Jin-Hyuk Hong, Sung-Bae Cho
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 10 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
14 years 2 months ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi