Pages that link to "Item:Q3196616"
From MaRDI portal
The following pages link to On-line analysis of the TCP acknowledgment delay problem (Q3196616):
Displaying 17 items.
- Online data clustering algorithms in an RTLS system (Q399499) (← links)
- Optimally competitive list batching (Q837154) (← links)
- On the remote server problem or more about TCP acknowledgments (Q861268) (← links)
- TCP is competitive with resource augmentation (Q987404) (← links)
- Dynamic TCP acknowledgment with sliding window (Q1006072) (← links)
- Data aggregation in sensor networks: Balancing communication and delay costs (Q1008733) (← links)
- Nearly optimal strategies for special cases of on-line capital investment. (Q1401318) (← links)
- A faster off-line algorithm for the TCP acknowledgement problem. (Q1603523) (← links)
- Competitive analysis of organization networks or multicast acknowledgment: how much to wait? (Q1945175) (← links)
- New results on multi-level aggregation (Q1998855) (← links)
- On bin packing with clustering and bin packing with delays (Q2234744) (← links)
- A new model for the linear 1-dimensional online clustering problem (Q2254541) (← links)
- Parameter learning algorithm for the online data acknowledgment problem (Q3093050) (← links)
- Price Fluctuations: To Buy or to Rent (Q3558910) (← links)
- A competitive analysis for retransmission timeout (Q4262699) (← links)
- Online Algorithms for Multilevel Aggregation (Q5130492) (← links)
- Dynamic TCP acknowledgement and other stories about e/(e-1) (Q5176008) (← links)