142 search results - page 7 / 29 » On-the-Fly Clause Improvement |
ILP
2004
Springer
14 years 1 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
CSR
2007
Springer
14 years 1 months ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
DAC
2001
ACM
14 years 8 months ago
2001
ACM
In this paper, we present a new technique for the e cient dynamic detection and removal of inactive clauses, i.e. clauses that do not a ect the solutions of interest of a Boolean ...
SAT
2005
Springer
14 years 1 months ago
2005
Springer
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
ICMCS
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper, we study the collision property of one of the robust hash functions proposed in [1]. This method was originally proposed for robust hash generation from blocks of i...