846 search results - page 51 / 170 » Rewrite-Based Decision Procedures |
IJCAI
1997
13 years 11 months ago
1997
Windowing has been proposed as a procedure for efficient memory use in the ID3 decision tree learning algorithm. However, it was shown that it may often lead to a decrease in perf...
SIGMOD
1996
ACM
14 years 2 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
ATAL
2009
Springer
14 years 1 months ago
2009
Springer
The goal of this paper is to explore the effects of synchronization on distributed decision making processes. In particular, we examine the dynamics of a spatially distributed mul...
CADE
2005
Springer
14 years 10 months ago
2005
Springer
We present a combination method for generating interpolants for a class of first-order theories. Using interpolant-generation procedures for individual theories as black-boxes, our...
SAT
2005
Springer
14 years 3 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...