824 search results - page 27 / 165 » Constructing Functional Programs for Grammar Analysis Proble... |
140
click to vote
AGP
2003
IEEE
15 years 11 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...
183
click to vote
EUROGP
2007
Springer
16 years 2 days 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...
164
click to vote
GPEM
2008
15 years 6 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...
174
click to vote
BMCBI
2005
15 years 5 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...
174
click to vote
FSTTCS
1998
Springer
15 years 9 months 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 ...