484 search results - page 69 / 97 » Computing Hilbert Class Polynomials |
137
click to vote
MP
2006
15 years 5 months ago
2006
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
201
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
186
click to vote
MOBICOM
2006
ACM
15 years 11 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...
150
Voted
RTSS
2002
IEEE
15 years 10 months ago
2002
IEEE
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic ...
163
Voted
SAGT
2009
Springer
15 years 9 months ago
2009
Springer
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...