Know when to persist: deriving value from a stream buffer (extended abstract)

DOI10.1007/978-3-319-41168-2_9MaRDI QIDQ2830062zbMATH OpenOpenAlexFDO

Authors Konstantinos Georgiou, George Karakostas, Evangelos Kranakis, D. Krizanc

Publication date 9 November 2016

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-41168-2_9

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Recommendations

• Know when to persist: deriving value from a stream buffer
• On the advice complexity of buffer management
• Collecting weighted items from a dynamic queue
• Online buffer management for transmitting packets with processing cycles
• Online stochastic reordering buffer scheduling

Cites work

• A multiple-choice secretary algorithm with applications to online auctions
• A new secretary problem with rank-based selection and cardinal payoffs
• A secretary problem with uncertain employment
• Approximate counting of inversions in a data stream
• Data streams: algorithms and applications.
• Know when to persist: deriving value from a stream buffer
• Matroids, secretary problems, and online mechanisms
• Submodular secretary problem and extensions
• The infinite secretary problem
• The Secretary Problem and Its Extensions: A Review
• The space complexity of approximating the frequency moments
• Who solved the secretary problem

Cited in

(1)

• Know when to persist: deriving value from a stream buffer

This page was built for publication: Know when to persist: deriving value from a stream buffer (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830062)