Sciweavers

1972 search results - page 133 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
PC
2006
153views Management» more  PC 2006»
13 years 9 months ago
Algorithmic skeletons meeting grids
In this work, we discuss an extension of the set of principles that should guide the future design and development of skeletal programming systems, as defined by Cole in his ``pra...
Marco Danelutto, Marco Aldinucci
EUROGP
2007
Springer
143views Optimization» more  EUROGP 2007»
14 years 1 months ago
Confidence Intervals for Computational Effort Comparisons
Abstract. When researchers make alterations to the genetic programming algorithm they almost invariably wish to measure the change in performance of the evolutionary system. No one...
Matthew Walker, Howard Edwards, Chris H. Messom
FPL
2010
Springer
188views Hardware» more  FPL 2010»
13 years 7 months ago
SeqHive: A Reconfigurable Computer Cluster for Genome Re-sequencing
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...
Kristian Stevens, Henry Chen, Terry Filiba, Peter ...
FSEN
2009
Springer
14 years 4 months ago
A Safe Implementation of Dynamic Overloading in Java-Like Languages
We present a general technique for extending Java-like languages with dynamic overloading, where method selection depends on the dynamic type of the parameter, instead of just the ...
Lorenzo Bettini, Sara Capecchi, Betti Venneri
POPL
2012
ACM
12 years 5 months ago
The ins and outs of gradual type inference
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
Aseem Rastogi, Avik Chaudhuri, Basil Hosmer