Sciweavers

470 search results - page 85 / 94
» Tabu Search for SAT
Sort
View
CSCWD
2009
Springer
14 years 2 months ago
Random stimulus generation with self-tuning
Constrained random simulation methodology still plays an important role in hardware verification due to the limited scalability of formal verification, especially for the large an...
Yanni Zhao, Jinian Bian, Shujun Deng, Zhiqiu Kong
IAT
2006
IEEE
14 years 1 months ago
A Multi-stage Graph Decomposition Algorithm for Distributed Constraint Optimisation
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
Terence H.-W. Law, Adrian R. Pearce
CAV
2003
Springer
156views Hardware» more  CAV 2003»
14 years 23 days ago
Abstraction and BDDs Complement SAT-Based BMC in DiVer
ion and BDDs Complement SAT-based BMC in DiVer Aarti Gupta1, Malay Ganai1 , Chao Wang2, Zijiang Yang1, Pranav Ashar1 1 NEC Laboratories America, Princeton, NJ, U.S.A. 2 University ...
Aarti Gupta, Malay K. Ganai, Chao Wang, Zijiang Ya...
ICDCS
2000
IEEE
13 years 12 months ago
The Effect of Nogood Learning in Distributed Constraint Satisfaction
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
Makoto Yokoo, Katsutoshi Hirayama
CP
2008
Springer
13 years 9 months ago
Probabilistically Estimating Backbones and Variable Bias: Experimental Overview
Backbone variables have the same assignment in all solutions to a given constraint satisfaction problem; more generally, bias represents the proportion of solutions that assign a v...
Eric I. Hsu, Christian J. Muise, J. Christopher Be...