On dichotomous search with direction-dependent costs for a uniformly hidden object
From MaRDI portal
Publication:5753737
DOI10.1080/02331939008843538zbMath0721.90048MaRDI QIDQ5753737
Publication date: 1990
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939008843538
90B40: Search theory
90C39: Dynamic programming
90C40: Markov and semi-Markov decision processes
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Monotonicity and efficient computation of optimal dichotomous search, On polychotomous search problems, An asymptotic theory for recurrence relations based on minimization and maximization., Operations research applications of dichotomous search, A problem of minimax estimation with directional information, On the cost of optimal alphabetic code trees with unequal letter costs, Increasing Lipschitz continuous maximizers of some dynamic programs
Cites Work