3415 search results - page 304 / 683 » Lower bounds on kernelization |
193
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
170
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
164
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
134
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— This paper presents a new double space-time transmit diversity-orthogonal frequency division multiplexing (DSTTD-OFDM) scheme using the zero-forcing decisionfeedback (ZF-DF) de...
184
click to vote
FCCM
2000
IEEE
15 years 11 months ago
2000
IEEE
Although run-time reconfigurable systems have been shown to achieve very high performance, the speedups over traditional microprocessor systems are limited by the cost of configur...