288 search results - page 24 / 58 » Inclusion Problems for Patterns with a Bounded Number of Var... |
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
DSN
2004
IEEE
13 years 11 months ago
2004
IEEE
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
FPGA
1999
ACM
13 years 12 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
CP
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...