Sciweavers

1805 search results - page 162 / 361
» Functional programming with structured graphs
Sort
View
GPEM
2006
89views more  GPEM 2006»
15 years 1 months ago
Morphological algorithm design for binary images using genetic programming
This paper presents a Genetic Programming (GP) approach to the design of Mathematical Morphology (MM) algorithms for binary images. The algorithms are constructed using logic opera...
Marcos I. Quintana, Riccardo Poli, Ela Claridge
ICFP
2010
ACM
15 years 1 months ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat
BMCBI
2004
133views more  BMCBI 2004»
15 years 1 months ago
Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction
Background: RNA secondary structure prediction methods based on probabilistic modeling can be developed using stochastic context-free grammars (SCFGs). Such methods can readily co...
Robin D. Dowell, Sean R. Eddy
ESOP
2009
Springer
15 years 8 months ago
Practical Variable-Arity Polymorphism
Just as some functions have uniform behavior over distinct types, other functions have uniform behavior over distinct arities. These variable-arity functions are widely used in scr...
T. Stephen Strickland, Sam Tobin-Hochstadt, Matthi...
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
15 years 8 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold