6829 search results - page 996 / 1366 » Quantitative Generalizations of Languages |
209
click to vote
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
286
click to vote
VEE
2012
ACM
14 years 2 months ago
2012
ACM
Flexible and efficient runtime design requires an understanding of the dependencies among the components internal to the runtime and those between the application and the runtime...
145
click to vote
PLDI
2012
ACM
13 years 9 months 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 ...
238
click to vote
ISSTA
2012
ACM
13 years 9 months ago
2012
ACM
Swarm testing is a novel and inexpensive way to improve the diversity of test cases generated during random testing. Increased diversity leads to improved coverage and fault detec...
229
click to vote
EDBT
2012
ACM
13 years 9 months ago
2012
ACM
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...