834 search results - page 74 / 167 » A Decomposition Technique for Max-CSP |
184
click to vote
VLSID
2002
IEEE
15 years 11 months ago
2002
IEEE
A new approach to synthesizing totally symmetric Boolean functions is presented. First, a novel cellular array is introduced for synthesizing unate symmetric functions. Using this...
148
click to vote
VTS
1998
IEEE
15 years 10 months ago
1998
IEEE
A fast fault-tolerant controller structure is presented, which is capable of recovering from transient faults by performing a rollback operation in hardware. The proposed fault-to...
158
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
138
click to vote
GI
2007
Springer
15 years 10 months ago
2007
Springer
: The decomposition of planning and scheduling problems is a well known technique to make these problems tractable. The resulting dependable subproblems were often solved using dif...
193
click to vote
MASCOTS
2004
15 years 7 months ago
2004
In this paper, we describe the dual-processor parallelisation of a symbolic (BDD-based) implementation of probabilistic model checking. We use multi-terminal BDDs, which allow a c...