1502 search results - page 24 / 301 » Node weighted scheduling |
LCN
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper describes a new mechanism to garantee quality of service for multimedia streams in low-cost home networks. Quality of service is based on a token, of which the route in...
101
click to vote
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
110
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take pa...
104
click to vote
PAKDD
2007
ACM
15 years 6 months ago
2007
ACM
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...