1552 search results - page 45 / 311 » On the Complexity of Constant Propagation |
114
click to vote
ESA
2007
Springer
15 years 8 months ago
2007
Springer
We study the problem of scheduling transmissions on the downlink of IEEE 802.16/WiMAX systems that use the OFDMA technology. These transmissions are scheduled using a matrix whose...
131
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
117
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
116
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
ANTS
2004
Springer
15 years 7 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...