96 search results - page 14 / 20 » Solving the Satisfiability Problem Using Finite Learning Aut... |
CADE
2002
Springer
14 years 7 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
ACSAC
2003
IEEE
14 years 24 days ago
2003
IEEE
This paper addresses the problem of detecting masquerading, a security attack in which an intruder assumes the identity of a legitimate user. Many approaches based on Hidden Marko...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Given a finite number of data points sampled from a low-dimensional manifold embedded in a high dimensional space together with the parameter vectors for a subset of the data poin...
HEURISTICS
2008
13 years 6 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Dictionary-based string matching (DBSM) is a critical component of Deep Packet Inspection (DPI), where thousands of malicious patterns are matched against high-bandwidth ...