144 search results - page 29 / 29 » The complexity of Boolean formula minimization |
CHARME
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
IH
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
ICC
2009
IEEE
13 years 5 months ago
2009
IEEE
Receive antenna selection (AS) reduces the hardware complexity of multi-antenna receivers by dynamically connecting an instantaneously best antenna element to the available radio ...