529 search results - page 100 / 106 » Simple Random Logic Programs |
BMCBI
2008
13 years 10 months ago
2008
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
ICPPW
2008
IEEE
14 years 4 months ago
2008
IEEE
The access patterns performed by disk-intensive applications vary widely, from simple contiguous reads or writes through an entire file to completely unpredictable random access....
ICCAD
1999
IEEE
14 years 2 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
PLDI
2012
ACM
12 years 8 days ago
2012
ACM
Developers frequently use inefficient code sequences that could be fixed by simple patches. These inefficient code sequences can cause significant performance degradation and ...
PLDI
2010
ACM
14 years 7 months ago
2010
ACM
An ad hoc data format is any non-standard, semi-structured data format for which robust data processing tools are not available. In this paper, we present ANNE, a new kind of mark...