372 search results - page 13 / 75 » time 1996 |
83
Voted
SODA
1996
ACM
15 years 1 months ago
1996
ACM
The Maximum Agreement Subtree problem is the following: given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these i...
94
Voted
RTSS
1996
IEEE
15 years 4 months ago
1996
IEEE
The well-known periodic task model of Liu and Layland 1] assumes a worst-case execution time bound for every task and may be too pessimistic if the worst-case execution time of a ...
83
Voted
ICNP
1996
IEEE
15 years 4 months ago
1996
IEEE
Abstract-- We present a scheduling protocol, called TimeShift Scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a p...
83
Voted
INFOCOM
1996
IEEE
15 years 4 months ago
1996
IEEE
Rate based congestion management for computer communication networks has been the focus of considerable research recently. Dierent variants to the end-to-end rate based algorithm ...
ISSS
1996
IEEE
15 years 4 months ago
1996
IEEE
Traditionally, application specific computations have been focusing on numerically intensive data manipulation. Modern communications and DSP applications, such as WWW, interactiv...