674 search results - page 126 / 135 » Explanation Based Program Transformation |
315
Voted
DAC
2012
ACM
13 years 2 months ago
2012
ACM
Much recent research [8, 6, 7] suggests significant power and energy benefits of relaxing correctness constraints in future processors. Such processors with relaxed constraints ...
184
click to vote
PLDI
2009
ACM
16 years 8 days ago
2009
ACM
The serious bugs and security vulnerabilities facilitated by C/C++'s lack of bounds checking are well known, yet C and C++ remain in widespread use. Unfortunately, C's a...
107
click to vote
KDD
2009
ACM
16 years 4 days ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
102
click to vote
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
99
Voted
DAGSTUHL
1996
15 years 28 days ago
1996
Recently, considerable advances have been made in the (on-line) control of logic program specialisation. A clear conceptual distinction has been established between local and glob...