Sciweavers

243 search results - page 47 / 49
» Congestion games with failures
Sort
View
CORR
2010
Springer
261views Education» more  CORR 2010»
13 years 7 months ago
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
Mathieu Cunche, Valentin Savin, Vincent Roca
PODC
2010
ACM
14 years 1 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 11 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 11 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
HICSS
2002
IEEE
92views Biometrics» more  HICSS 2002»
14 years 2 months ago
Strategic 'Morphing' and the Survivability of E-commerce Firms
Over the past year, the shakeout in the electronic commerce marketplace has redirected the attention of entrepreneurs and investors from the funding hype surrounding Internet star...
Robert J. Kauffman, Bin Wang, Tim Miller