15 search results - page 2 / 3 » Fast Tactic-Based Theorem Proving |
ACMSE
2006
ACM
14 years 20 days ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
INFOCOM
2012
IEEE
11 years 9 months ago
2012
IEEE
—Intrusion Detection Systems (IDS) have become ubiquitous in the defense against virus outbreaks, malicious exploits of OS vulnerabilities, and botnet proliferation. As attackers...
IEEEPACT
2007
IEEE
14 years 1 months ago
2007
IEEE
The process of verifying a new microprocessor is a major problem for the computer industry. Currently, architects design processors to be fast, power-efficient, and reliable. Howe...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...
SIAMAM
2002
13 years 6 months ago
2002
The theory of periodic wavelet transforms presented here was originally developed to deal with the problem of epileptic seizure prediction. A central theorem in the theory is the c...