Sciweavers

1174 search results - page 17 / 235
» Derivation of Characteristic Formulae
Sort
View
117
Voted
ISQED
2002
IEEE
126views Hardware» more  ISQED 2002»
15 years 6 months ago
Formulae for Performance Optimization and Their Applications to Interconnect-Driven Floorplanning
As the process technology advances into the deep submicron era, interconnect plays a dominant role in determining circuit performance. Buffer insertion/sizing and wire sizing are ...
Nicholas Chia-Yuan Chang, Yao-Wen Chang, Iris Hui-...
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 1 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
C3S2E
2010
ACM
15 years 3 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 6 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
108
Voted
ATAL
2006
Springer
15 years 5 months ago
Deriving axioms across ontologies
Ontologies play a key role in agent communication and the emerging Semantic Web. Axioms are an important component of ontologies to describe the relationships among the concepts. ...
Dejing Dou, Drew V. McDermott