On Time Lookahead Algorithms for the Online Data Acknowledgement Problem 1st Edition by Csanad Imreh, Tamas Nemeth ISBN 9783540744566
Original price was: $50.00.$35.00Current price is: $35.00.
Authors:Csanád Imreh; Tamás Németh , Tags:Mathematical Foundations of Computer Science 2007 , Author sort:Imreh, Csanád & Németh, Tamás , Languages:Languages:eng , Comments:Comments:Mathematical Foundations of Computer Science 2007
On Time Lookahead Algorithms for the Online Data Acknowledgement Problem 1st Edition by Csanad Imreh, Tamas Nemeth – Ebook PDF Instant Download/Delivery. 9783540744566
Full download On Time Lookahead Algorithms for the Online Data Acknowledgement Problem 1st Edition after payment
Product details:
ISBN 10:
ISBN 13: 9783540744566
Author: Csanad Imreh, Tamas Nemeth
In this work we investigate such online algorithms for the data acknowledgement problem, which have extra information about the arrival time of the packets in the following time interval of length c. We present an algorithm with the smallest possible competitive ratio for the maximum of delay type objective function. In the case of the sum of delay type objective function we present an 1 + O(1/c)-competitive algorithm. Moreover we show that no algorithm may have smaller competitive ratio than 1 + Ω(1/c 2) in the case of that objective function.
On Time Lookahead Algorithms for the Online Data Acknowledgement Problem 1st Table of contents:
1 Introduction
2 Preliminaries
3 The fmax objective function
4 The sum objective function
People also search for On Time Lookahead Algorithms for the Online Data Acknowledgement Problem 1st:
on time lookahead algorithms for the online data
online learning algorithms
online algorithms
online learning for time series prediction
online algorithm definition
You may also like…
eBook PDF
On the Complexity of Computing Treelength 1st Edition by Daniel Lokshtanov ISBN 9783540744566
