Sciweavers

1985 search results - page 244 / 397
» A Minimal Periods Algorithm with Applications
Sort
View
182
Voted
SIGCOMM
2004
ACM
15 years 9 months ago
An algebraic approach to practical and scalable overlay network monitoring
Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay net...
Yan Chen, David Bindel, Han Hee Song, Randy H. Kat...
129
Voted
RTCSA
2000
IEEE
15 years 8 months ago
Task attribute assignment of fixed priority scheduled tasks to reenact off-line schedules
A number of industrial applications advocate the use of time-triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-...
Radu Dobrin, Yusuf Özdemir, Gerhard Fohler
103
Voted
KDD
2010
ACM
188views Data Mining» more  KDD 2010»
15 years 5 months ago
Inferring networks of diffusion and influence
Information diffusion and virus propagation are fundamental processes talking place in networks. While it is often possible to directly observe when nodes become infected, observi...
Manuel Gomez-Rodriguez, Jure Leskovec, Andreas Kra...
106
Voted
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
15 years 9 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
133
Voted
AIPS
2003
15 years 4 months ago
Decision-Theoretic Group Elevator Scheduling
We present an efficient algorithm for exact calculation and minimization of expected waiting times of all passengers using a bank of elevators. The dynamics of the system are rep...
Daniel Nikovski, Matthew Brand