Sciweavers

256 search results - page 10 / 52
» Comparison of Heuristic and Optimal Subcarrier Assignment Al...
Sort
View
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
14 years 2 months ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith
ISCC
2000
IEEE
104views Communications» more  ISCC 2000»
14 years 1 months ago
Dynamic Routing and Wavelength Assignment Using First Policy Iteration
With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution bec...
Esa Hyytiä, Jorma T. Virtamo
ICPR
2008
IEEE
14 years 3 months ago
Comparison of Particle Swarm Optimization and Genetic Algorithm for HMM training
Hidden Markov Model (HMM) is the dominant technology in speech recognition. The problem of optimizing model parameters is of great interest to the researchers in this area. The Ba...
Fengqin Yang, Changhai Zhang, Tieli Sun
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
14 years 2 months ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny
CORR
2010
Springer
427views Education» more  CORR 2010»
13 years 7 months ago
A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algori
Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent charact...
Poonam Garg