655 search results - page 11 / 131 » On Flat Programs with Lists |
CP
2004
Springer
13 years 11 months ago
2004
Springer
This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In ad...
ICEIS
2009
IEEE
14 years 2 months ago
2009
IEEE
We propose two methods for constructing automated programs for extraction of information from a class of web pages that are very common and of high practical significance - varia...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
We present an alternative approach to shortcut fusion based on the function unfoldr. Despite its simplicity the technique can remove intermediate lists in examples which are known...
BMCBI
2007
13 years 7 months ago
2007
Background: Gas chromatography-mass spectrometry (GC-MS) is a robust platform for the profiling of certain classes of small molecules in biological samples. When multiple samples ...
CAV
2009
Springer
14 years 8 months ago
2009
Springer
We provide a verification technique for a class of programs working on integer arrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL [13] to spe...