Sciweavers

1614 search results - page 232 / 323
» Polymorphism and Genetic Programming
Sort
View
DAGSTUHL
2006
14 years 9 days ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 5 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
13 years 10 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
ACMSE
2009
ACM
14 years 2 months ago
Using computer graphics to explore object oriented concepts using C
Most recent graphics courses are what we would call topdown courses. Courses that focus on using graphical packages to implement and teach graphics. The course discussed in this p...
William C. Kreahling
WOB
2004
120views Bioinformatics» more  WOB 2004»
14 years 8 days 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...