Applying POS(i) rules to communication problems

DOI10.1239/JAP/1032265223zbMath0916.60064OpenAlexW2028443830MaRDI QIDQ4228278

Kin-Tak Lam, King Sing Chong

Publication date: 2 February 1999

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1032265223

zbMATH Keywords

communication networkslinear searchMarkov chain modelscomparison of search costs

Mathematics Subject Classification ID

Searching and sorting (68P10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (1)

MOVE-FORWARD RULES AND f-SWAP RULES APPLIED TO A COMMUNICATION PROBLEM

This page was built for publication: Applying POS(i) rules to communication problems