Sciweavers

2652 search results - page 325 / 531
» Privacy-preserving linear programming
Sort
View
107
Voted
ASPDAC
2004
ACM
87views Hardware» more  ASPDAC 2004»
15 years 8 months ago
ShatterPB: symmetry-breaking for pseudo-Boolean formulas
Many important tasks in circuit design and verification can be performed in practice via reductions to Boolean Satisfiability (SAT), making SAT a fundamental EDA problem. However ...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
FPL
2004
Springer
75views Hardware» more  FPL 2004»
15 years 8 months ago
Multiple Restricted Multiplication
Abstract. This paper focuses on a class of problem relating to the multiplication of a single number by several coefficients that, while not constant, are drawn from a finite set ...
Nalin Sidahao, George A. Constantinides, Peter Y. ...
112
Voted
ICALP
2004
Springer
15 years 8 months ago
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
Olivier Bournez, Emmanuel Hainry
ICCS
2004
Springer
15 years 8 months ago
Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
Hyunseung Choo, Vladimir V. Shakhov
IFIP
2004
Springer
15 years 8 months ago
On Complexity of Model-Checking for the TQL Logic
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
Iovka Boneva, Jean-Marc Talbot