Sciweavers

1130 search results - page 149 / 226
» Bandit-Based Genetic Programming
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 4 months ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks
SAC
2006
ACM
14 years 9 months ago
Challenges in the compilation of a domain specific language for dynamic programming
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
Robert Giegerich, Peter Steffen
WOB
2004
120views Bioinformatics» more  WOB 2004»
14 years 11 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...
CEC
2010
IEEE
14 years 11 months ago
Generating a novel sort algorithm using Reinforcement Programming
Abstract-- Reinforcement Programming (RP) is a new approach to automatically generating algorithms, that uses reinforcement learning techniques. This paper describes the RP approac...
Spencer K. White, Tony R. Martinez, George L. Rudo...
RECOMB
2009
Springer
15 years 4 months ago
Pseudo Boolean Programming for Partially Ordered Genomes
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, num...
Sébastien Angibaud, Guillaume Fertin, Annel...