1092 search results - page 40 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
132
click to vote
MOBICOM
2006
ACM
15 years 5 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
STOC
2010
ACM
15 years 9 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
ICML
2009
IEEE
16 years 18 days ago
2009
IEEE
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
SIGECOM
2004
ACM
15 years 5 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
SIAMJO
2000
14 years 11 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...