933 search results - page 183 / 187 » Extending Forward Checking |
118
click to vote
ICCAD
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
110
click to vote
PEPM
1999
ACM
15 years 3 months ago
1999
ACM
A certifying compiler takes a source language program and produces object code, as well as a certi cate" that can be used to verify that the object code satis es desirable pr...
CLUSTER
2004
IEEE
15 years 3 months ago
2004
IEEE
The Rocks toolkit [9], [7], [10] uses a graph-based framework to describe the configuration of all node types (termed appliances) that make up a complete cluster. With hundreds of...
CCS
2006
ACM
15 years 3 months ago
2006
ACM
In trust negotiation and other distributed proving systems, networked entities cooperate to form proofs that are justified by collections of certified attributes. These attributes...
115
Voted
COCO
2010
Springer
15 years 2 months ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...