738 search results - page 132 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
92
Voted
JFP
2000
14 years 9 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
We seek to gain improved insight into how Web search engines should cope with the evolving Web, in an attempt to provide users with the most up-to-date results possible. For this ...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
This paper reconsiders the threat posed by Shacham's "return-oriented programming" -- a technique by which WX-style hardware protections are evaded via carefully cr...
UAI
2008
14 years 11 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
105
click to vote
PDCN
2004
14 years 11 months ago
2004
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...