Delay-tolerant delivery of quality information in ad hoc networks
type: Item
instance of: scholarly article
title: Delay-tolerant delivery of quality information in ad hoc networks
zbMATH Open document ID: 1219.68033
author: Stathes Hadjiefthymiades
author: Christos Anagnostopoulos
published in: Journal of Parallel and Distributed Computing
publication date: 2011-08-19T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 5940545
zbMATH Keywords: optimal stopping theory
zbMATH Keywords: delay-tolerant information delivery
zbMATH Keywords: discounted secretary problem
zbMATH Keywords: optimal online search algorithm
MaRDI profile type: Publication
full work available at URL: j.jpdc.2010.11.007
OpenAlex ID: W1995550296
cites work: Improved algorithms and analysis for secretary problems and generalizations
cites work: Optimal search and one-way trading online algorithms
cites work: Optimal Sequential Selection From a Known Distribution With Holding Costs
cites work: The Secretary Problem and Its Extensions: A Review
cites work: Optimal stopping problem with recall cost
cites work: Q3683893
cites work: The finite-memory secretary problem
cites work: Optimal stopping problem with finite-period reservation
cites work: An optimal parking problem
cites work: Optimal Algorithms for the Online Time Series Search Problem
DOI: 10.1016/J.JPDC.2010.11.007
description: scientific article; zbMATH DE number 5940545