Sciweavers

203 search results - page 12 / 41
» Open issues in genetic programming
Sort
View
SAC
2006
ACM
13 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
CHI
2008
ACM
14 years 10 months ago
Ingimp: introducing instrumentation to an end-user open source application
Open source projects are gradually incorporating usability methods into their development practices, but there are still many unmet needs. One particular need for nearly any open ...
Michael Terry, Matthew Kay, Brad Van Vugt, Brandon...
BMCBI
2005
126views more  BMCBI 2005»
13 years 9 months ago
GANN: Genetic algorithm neural networks for the detection of conserved combinations of features in DNA
Background: The multitude of motif detection algorithms developed to date have largely focused on the detection of patterns in primary sequence. Since sequence-dependent DNA struc...
Robert G. Beiko, Robert L. Charlebois
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 9 months ago
Continuations, proofs and tests
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
Stefano Guerrini, Andrea Masini
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
14 years 6 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu