1452 search results - page 116 / 291 » Algorithmic Analysis of Array-Accessing Programs |
117
click to vote
CSMR
1999
IEEE
15 years 6 months ago
1999
IEEE
Maintenance activities are made more difficult when pointers are heavily used in source code: the programmer needs to build a mental model of memory locations and of the way they ...
112
click to vote
ESOP
2000
Springer
15 years 5 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
131
Voted
BMCBI
2007
15 years 2 months ago
2007
Background: Genomic deletions and duplications are important in the pathogenesis of diseases, such as cancer and mental retardation, and have recently been shown to occur frequent...
126
click to vote
MST
1998
15 years 1 months ago
1998
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
119
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...