1220 search results - page 213 / 244 » Minimal Interval Completions |
EMSOFT
2007
Springer
14 years 1 months ago
2007
Springer
Software components are modular and can enable post-deployment update, but their high overhead in runtime and memory is prohibitive for many embedded systems. This paper proposes ...
ACSAC
2006
IEEE
14 years 1 months ago
2006
IEEE
Address space randomization is an emerging and promising method for stopping a broad range of memory corruption attacks. By randomly shifting critical memory regions at process in...
ISCA
2005
IEEE
14 years 1 months ago
2005
IEEE
CMOS scaling increases susceptibility of microprocessors to transient faults. Most current proposals for transient-fault detection use full redundancy to achieve perfect coverage ...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
EUROCOLT
1999
Springer
13 years 12 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...