210 search results - page 30 / 42 » Universal Booleanization of Constraint Models |
ETS
2006
IEEE
13 years 9 months ago
2006
IEEE
Typically, most research and academic institutions own and archive a great amount of objects and research related resources that have been produced, used and maintained over long ...
ICCAD
2000
IEEE
14 years 2 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
ICDT
2010
ACM
14 years 1 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
SAT
2010
Springer
13 years 8 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
DAC
2008
ACM
14 years 10 months ago
2008
ACM
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...