Sciweavers

1972 search results - page 126 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
TCS
2008
13 years 9 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
NAR
2007
129views more  NAR 2007»
13 years 9 months ago
taveRNA: a web suite for RNA algorithms and applications
We present taveRNA, a web server package that hosts three RNA web services: alteRNA, inteRNA and pRuNA. alteRNA is a new alternative for RNA secondary structure prediction. It is ...
Cagri Aksay, Raheleh Salari, Emre Karakoç, ...
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
14 years 3 months ago
Towards identifying populations that increase the likelihood of success in genetic programming
This paper presents a comprehensive, multivariate account of how initial population material is used over the course of a genetic programming run as while various factors influenc...
Jason M. Daida
GECCO
2009
Springer
192views Optimization» more  GECCO 2009»
13 years 7 months ago
Improving SMT performance: an application of genetic algorithms to configure resizable caches
Simultaneous Multithreading (SMT) is a technology aimed at improving the throughput of the processor core by applying Instruction Level Parallelism (ILP) and Thread Level Parallel...
Josefa Díaz, José Ignacio Hidalgo, F...
ICANNGA
2007
Springer
138views Algorithms» more  ICANNGA 2007»
14 years 3 months ago
Liquid State Genetic Programming
Abstract. A new Genetic Programming variant called Liquid State Genetic Programming (LSGP) is proposed in this paper. LSGP is a hybrid method combining a dynamic memory for storing...
Mihai Oltean