1813 search results - page 57 / 363 » Instance Pruning Techniques |
EURODAC
1995
IEEE
15 years 3 months ago
1995
IEEE
Computing equivalence classes for FSMs has several applications to synthesis and veri cation problems. Symbolic traversal techniques are applicable to medium-small circuits. This ...
GAMEON
2001
15 years 1 months ago
2001
This paper investigates the application of neural network techniques to the creation of a program that can play the game of Go with some degree of success. The combination of soft...
113
click to vote
CP
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...
188
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
DAC
2004
ACM
16 years 25 days ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...