Optimal search algorithm for a minimum of a discrete periodic bimodal function

DOI10.1016/0020-0190(88)90115-9MaRDI QIDQ1114409zbMATH OpenOpenAlexFDO

Authors Boris S. Veroy

Publication date 1988

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(88)90115-9

zbMATH Keywords

searchcommunication networkoptimal algorithminformation-based complexitypartition analysis

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Applications of design theory to circuits and networks (94C30)

Recommendations

• Optimal search algorithm for extrema of a discrete periodic bimodal function
• An optimal algorithm for search of extrema of a bimodal function
• An optimum procedure for searching for the global extremum of a locally unimodal function
• scientific article; zbMATH DE number 5621990
• Minimizing a unimodal function of two integer variables

Cites work

• scientific article; zbMATH DE number 3174053 (Why is no real title available?)
• scientific article; zbMATH DE number 3688714 (Why is no real title available?)
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• scientific article; zbMATH DE number 3475295 (Why is no real title available?)
• An optimal algorithm for search of extrema of a bimodal function
• Average complexity of divide-and-conquer algorithms
• Distributed packet switching queueing network design

Cited in

(3)

• Optimal search algorithm for extrema of a discrete periodic bimodal function
• An optimal algorithm for search of extrema of a bimodal function
• scientific article; zbMATH DE number 3924495 (Why is no real title available?)

This page was built for publication: Optimal search algorithm for a minimum of a discrete periodic bimodal function

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