1278 search results - page 135 / 256 » The Complexity of Weighted Boolean |
FSTTCS
2010
Springer
13 years 8 months ago
2010
Springer
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objectiv...
COCO
2005
Springer
14 years 3 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
STACS
2005
Springer
14 years 3 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
ISCC
2008
IEEE
14 years 4 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
ISCAS
2007
IEEE
14 years 4 months ago
2007
IEEE
— It is natural to envisage that in a telephone network, some telephone numbers originate or receive more calls than others. Indeed, real-life data have verified the conjecture ...