837 search results - page 76 / 168 » Hard combinators |
101
click to vote
AOSD
2008
ACM
15 years 1 months ago
2008
ACM
One difficulty in software maintenance is that the relationship between observed program behavior and source code is not always clear. In this paper we are concerned specifically ...
101
click to vote
CAV
2008
Springer
15 years 1 months ago
2008
Springer
Program verification for relaxed memory models is hard. The high degree of nondeterminism in such models challenges standard verification techniques. This paper proposes a new veri...
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Pattern Databases were a major breakthrough in heuristic search by solving hard combinatorial problems various orders of magnitude faster than state-of-the-art techniques at that ...
FSE
2008
Springer
15 years 1 months ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...