914 search results - page 43 / 183 » Branch and Bound on the Network Model |
COLT
2006
Springer
15 years 1 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
A constant gap between the deterministic model of a class of a wireless relay network and its Gaussian model counterpart is derived. The method is constructive in the sense that a ...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
110
click to vote
ALGORITHMICA
2005
14 years 9 months ago
2005
In an adversarial queueing network, the incoming traffic is decided by an adversary, who operates under a reasonable rate restriction. This model provides a valuable, complementar...
INFOCOM
1996
IEEE
15 years 1 months ago
1996
IEEE
In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of...