Sciweavers

1589 search results - page 192 / 318
» Constraints with Variables' Annotations
Sort
View
AAAI
2006
13 years 11 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
Carla P. Gomes, Ashish Sabharwal, Bart Selman
CSDA
2006
72views more  CSDA 2006»
13 years 10 months ago
Generalized theory of uncertainty (GTU) - principal concepts and ideas
Uncertainty is an attribute of information. The path-breaking work of Shannon has led to a universal acceptance of the thesis that information is statistical in nature. Concomitan...
Lotfi A. Zadeh
COR
2007
106views more  COR 2007»
13 years 9 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...
DAC
2009
ACM
14 years 4 months ago
Clock skew optimization via wiresizing for timing sign-off covering all process corners
Manufacturing process variability impacts the performance of synchronous logic circuits by means of its effect on both clock network and functional block delays. Typically, varia...
Sari Onaissi, Khaled R. Heloue, Farid N. Najm
TACAS
2009
Springer
109views Algorithms» more  TACAS 2009»
14 years 4 months ago
TaPAS: The Talence Presburger Arithmetic Suite
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
Jérôme Leroux, Gérald Point