Sciweavers

1452 search results - page 78 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
PADL
2009
Springer
16 years 28 days ago
Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell
Analysis of biological data often involves large data sets and computationally expensive algorithms. Databases of biological data continue to grow, leading to an increasing demand ...
Ketil Malde, Bryan O'Sullivan
TACAS
2007
Springer
74views Algorithms» more  TACAS 2007»
15 years 6 months ago
Shape Analysis by Graph Decomposition
Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the pro...
Roman Manevich, Josh Berdine, Byron Cook, G. Ramal...
COCO
2006
Springer
113views Algorithms» more  COCO 2006»
15 years 4 months ago
On the Complexity of Numerical Analysis
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
Eric Allender, Peter Bürgisser, Johan Kjeldga...
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
15 years 6 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
142
Voted
POPL
2010
ACM
15 years 9 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno