Sciweavers

179 search results - page 35 / 36
» Asynchronous Congestion Games
Sort
View
COMCOM
2004
127views more  COMCOM 2004»
13 years 5 months ago
Traffic splitting in a network: split traffic models and applications
The contemporary high-speed networks, e.g. the Internet and asynchronous transfer mode (ATM) networks provide a convenient and cost-effective communication platform to carry the e...
Huei-Wen Ferng, Cheng-Ching Peng
PODC
1989
ACM
13 years 10 months ago
Knowledge, Probability, and Adversaries
: What should it mean for an agent to know or believe an assertion is true with probability :99? Di erent papers FH88, FZ88, HMT88] give di erent answers, choosing to use quite di ...
Joseph Y. Halpern, Mark R. Tuttle
PODC
2010
ACM
13 years 10 months ago
Finding mobile data under delay constraints with searching costs
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002,...
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 7 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
SIROCCO
2004
13 years 7 months ago
Existence of Nash Equilibria in Selfish Routing Problems
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...
Alessandro Ferrante, Mimmo Parente