This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
—We investigate multiuser two-way relaying strategies for interference limited systems where multiple pairs of users exchange information with their partners via an intermediate ...
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
Simon de Givry, Javier Larrosa, Pedro Meseguer, Th...
We study the problem of scheduling transmissions on the downlink of IEEE 802.16/WiMAX systems that use the OFDMA technology. These transmissions are scheduled using a matrix whose...