Sciweavers

1502 search results - page 24 / 301
» Node weighted scheduling
Sort
View
LCN
2002
IEEE
14 years 2 months ago
Multimedia QoS in Low-Cost Home Networks
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...
Hans Scholten, Pierre G. Jansen, Ferdy Hanssen, Pi...
ICALP
2003
Springer
14 years 3 months ago
Convergence Time to Nash Equilibria
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...
Eyal Even-Dar, Alexander Kesselman, Yishay Mansour
INFOCOM
2009
IEEE
14 years 4 months ago
Computing the Capacity Region of a Wireless Network
—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...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 10 months ago
Stochastic Games for Security in Networks with Interdependent Nodes
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...
Kien C. Nguyen, Tansu Alpcan, Tamer Basar
PAKDD
2007
ACM
224views Data Mining» more  PAKDD 2007»
14 years 4 months ago
Graph Nodes Clustering Based on the Commute-Time Kernel
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...
Luh Yen, François Fouss, Christine Decaeste...