Sciweavers

8094 search results - page 311 / 1619
» Improvements in Formula Generalization
Sort
View
ICCAD
1999
IEEE
98views Hardware» more  ICCAD 1999»
15 years 9 months ago
Buffer block planning for interconnect-driven floorplanning
This paper studies buffer block planning for interconnect-driven floorplanning in deep submicron designs. We first introduce the concept of feasible region (FR) for buffer inserti...
Jason Cong, Tianming Kong, David Zhigang Pan
ISMVL
1999
IEEE
90views Hardware» more  ISMVL 1999»
15 years 9 months ago
Transformations between Signed and Classical Clause Logic
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
FOCS
1998
IEEE
15 years 9 months ago
Unsatisfiable Systems of Equations, Over a Finite Field
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...
Alan R. Woods
TABLEAUX
1999
Springer
15 years 9 months ago
Tableau Calculi for Hybrid Logics
Hybrid logics were proposed in 15 as a way of boosting the expressivity of modal logics via a novel mechanism: adding labels for states in Kripke models and viewing these labels as...
Miroslava Tzakova
GECCO
2010
Springer
156views Optimization» more  GECCO 2010»
15 years 8 months ago
Elementary landscape decomposition of the quadratic assignment problem
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
J. Francisco Chicano, Gabriel Luque, Enrique Alba