Sciweavers

121 search results - page 10 / 25
» Random Assignment with Integer Costs
Sort
View
ICALP
2003
Springer
14 years 21 days 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
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 7 months ago
Path-independent load balancing with unreliable machines
We consider algorithms for load balancing on unreliable machines. The objective is to optimize the two criteria of minimizing the makespan and minimizing job reassignments in resp...
James Aspnes, Yang Richard Yang, Yitong Yin
RSA
2010
118views more  RSA 2010»
13 years 5 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
CISS
2008
IEEE
14 years 2 months ago
Distributed algorithm and reversible network
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
Shreevatsa Rajagopalan, Devavrat Shah
ISLPED
2009
ACM
100views Hardware» more  ISLPED 2009»
14 years 2 months ago
Tuning-friendly body bias clustering for compensating random variability in subthreshold circuits
Post-fabrication tuning for mitigating manufacturing variability is receiving a significant attention. To reduce leakage increase involved in performance compensation by body bia...
Koichi Hamamoto, Masanori Hashimoto, Yukio Mitsuya...