4860 search results - page 440 / 972 » SNPs Problems, Complexity, and Algorithms |
108
click to vote
COMGEO
2004
ACM
15 years 3 months ago
2004
ACM
We investigate the problem of finding a minimal volume parallelepiped enclosing a given set of n threedimensional points. We give two mathematical properties of these parallelepip...
142
click to vote
ITA
2002
15 years 3 months ago
2002
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the be...
149
click to vote
WINET
2002
15 years 3 months ago
2002
The complexity of the mobility tracking problem in a cellular environment has been characterized under an information-theoretic framework. Shannon's entropy measure is identif...
162
click to vote
GLOBECOM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract-- We study joint rate control and resource allocation with QoS provisioning that maximizes the total utility of secondary users in cognitive radio networks. We formulate a...
159
click to vote
SWAT
2010
Springer
15 years 1 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...