Optimal search algorithm for extrema of a discrete periodic bimodal function

DOI10.1016/0885-064X(89)90006-XMaRDI QIDQ1121183zbMATH OpenFDO

Authors Boris S. Veroy

Publication date 1989

Published in Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

clustering analysisdata communication networkdiscrete periodic bimodal functionoptimality of the search algorithmRecursive computing

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Dynamic programming (90C39)

Recommendations

• Optimal search algorithm for a minimum 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 3987065
• scientific article; zbMATH DE number 5621990

Cites work

• scientific article; zbMATH DE number 3174053 (Why is no real title available?)
• scientific article; zbMATH DE number 3817545 (Why is no real title available?)
• scientific article; zbMATH DE number 3827201 (Why is no real title available?)
• scientific article; zbMATH DE number 3932991 (Why is no real title available?)
• scientific article; zbMATH DE number 4112013 (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 3574966 (Why is no real title available?)
• scientific article; zbMATH DE number 3597592 (Why is no real title available?)
• scientific article; zbMATH DE number 3634044 (Why is no real title available?)
• scientific article; zbMATH DE number 3347549 (Why is no real title available?)
• A survey of information-based complexity
• An optimal algorithm for search of extrema of a bimodal function
• Average case optimality
• Average complexity of divide-and-conquer algorithms
• Distributed packet switching queueing network design
• LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
• On the average number of steps of the simplex method of linear programming
• Parallel minimax search for a maximum
• Printer graphics for clustering
• Sequential Minimax Search for a Maximum When Prior Information is Available

Cited in

(2)

• Optimal search algorithm for a minimum of a discrete periodic bimodal function
• An optimal algorithm for search of extrema of a bimodal function

This page was built for publication: Optimal search algorithm for extrema 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 Q1121183)