5055 search results - page 219 / 1011 » Relative Timing |
150
click to vote
PAM
2005
Springer
15 years 12 months ago
2005
Springer
We propose a practical technique for the identification of lossy network links from end-to-end measurements. Our scheme is based on a function that computes the likelihood of each...
159
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
139
click to vote
ICC
2007
IEEE
16 years 25 days ago
2007
IEEE
— This paper mathematically frames the relation between window-based and rate-based congestion control algorithms, when the assumption of variable round-trip time conditions is i...
173
click to vote
IAJIT
2008
15 years 6 months ago
2008
: This paper presents a graph-coloring-based algorithm for the exam scheduling application, with the objective of achieving fairness, accuracy, and optimal exam time period. Throug...
159
click to vote
PODC
2003
ACM
15 years 11 months ago
2003
ACM
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...