Sciweavers

344 search results - page 41 / 69
» The Santa Claus problem
Sort
View
AIMSA
2008
Springer
14 years 4 months ago
Incorporating Learning in Grid-Based Randomized SAT Solving
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
CHARME
2005
Springer
136views Hardware» more  CHARME 2005»
14 years 3 months ago
Acceleration of SAT-Based Iterative Property Checking
Today, verification is becoming the dominating factor for successful circuit designs. In this context formal verification techniques allow to prove the correctness of a circuit ...
Daniel Große, Rolf Drechsler
PPDP
2005
Springer
14 years 3 months ago
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
Véronique Cortier, Michaël Rusinowitch...
HICSS
2003
IEEE
122views Biometrics» more  HICSS 2003»
14 years 3 months ago
A Three-Layer Architecture for E-Contract Enforcement in an E-Service Environment
In an e-service environment, contracts are important for attaining business process interoperability and enforcing their proper enactment. An e-contract is the computerized facili...
Dickson K. W. Chiu, Shing-Chi Cheung, Sven Till
AAAI
2008
14 years 6 days ago
A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
Hoifung Poon, Pedro Domingos, Marc Sumner