787 search results - page 85 / 158 » Polynomial Constants are Decidable |
127
click to vote
PERCOM
2006
ACM
16 years 3 months ago
2006
ACM
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...
139
click to vote
GLOBECOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—The degrees of freedom (DoF) of K-user MIMO interference networks with constant channel coefficients are not known in general. Determining the feasibility of a linear interfere...
134
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
120
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
120
click to vote
CCS
2003
ACM
15 years 9 months ago
2003
ACM
Informally, a communication protocol is sender k - anonymous if it can guarantee that an adversary, trying to determine the sender of a particular message, can only narrow down it...