824 search results - page 27 / 165 » Constructing Functional Programs for Grammar Analysis Proble... |
AGP
2003
IEEE
14 years 1 months ago
2003
IEEE
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
EUROGP
2007
Springer
14 years 2 months ago
2007
Springer
This work analyzes fitness landscapes for the image filter design problem approached using functional-level Cartesian Genetic Programming. Smoothness and ruggedness of fitness l...
GPEM
2008
13 years 8 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
BMCBI
2005
13 years 8 months ago
2005
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
FSTTCS
1998
Springer
14 years 2 days ago
1998
Springer
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...