Sciweavers

1133 search results - page 29 / 227
» Local Logics for Traces
Sort
View
104
Voted
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
15 years 2 months ago
Reconstructing strings from random traces
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andre...
107
Voted
CADE
1998
Springer
15 years 4 months ago
System Description: CRIL Platform for SAT
The CRIL multi-strategy platform for SAT includes a whole family of local search techniques and some of the best Davis and Putnam strategies for checking propositional satis abilit...
Bertrand Mazure, Lakhdar Sais, Éric Gr&eacu...
112
Voted
LOPSTR
2005
Springer
15 years 6 months ago
An Algorithm for Local Variable Elimination in Normal Logic Programs
A variable is local if it occurs in a clause body but not in its head. Local variables appear naturally in practical logic programming, but they complicate several aspects such as ...
Javier Álvez, Paqui Lucio
IWMM
2009
Springer
152views Hardware» more  IWMM 2009»
15 years 7 months ago
A new approach to parallelising tracing algorithms
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt
81
Voted
ACSAC
2004
IEEE
15 years 4 months ago
Tracing the Root of "Rootable" Processes
In most existing systems, the authorization check for system resource access is based on the user ID of the running processes. Such systems are vulnerable to password stealing/cra...
Amit Purohit, Vishnu Navda, Tzi-cker Chiueh