Sciweavers

3678 search results - page 24 / 736
» On the Stable Paths Problem
Sort
View
ICALP
1999
Springer
14 years 2 months ago
Stable Marriage with Incomplete Lists and Ties
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and seve...
Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasu...
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 9 months ago
Services within a busy period of an M/M/1 queue and Dyck paths
We analyze the service times of customers in a stable M/M/1 queue in equilibrium depending on their position in a busy period. We give the law of the service of a customer at the b...
Moez Draief, Jean Mairesse
QOSIP
2005
Springer
14 years 3 months ago
Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach
In this paper, we present a novel approach to the congestion control and resource allocation problem of elastic and real-time traffic in telecommunication networks. With the concep...
Tobias Harks
SIGCOMM
2012
ACM
12 years 9 days ago
Route shepherd: stability hints for the control plane
The Route Shepherd tool demonstrates applications of choosing between routing protocol configurations on the basis of rigorouslysupported theory. Splitting the configuration spa...
Alexander J. T. Gurney, Xianglong Han, Yang Li, Bo...
ICALP
1991
Springer
14 years 1 months ago
On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
Samir Khuller, Stephen G. Mitchell, Vijay V. Vazir...