Optimal search algorithm for extrema of a discrete periodic bimodal function

DOI10.1016/0885-064X(89)90006-XzbMath0673.90091MaRDI QIDQ1121183

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)

Cites Work

• Distributed packet switching queueing network design
• Average case optimality
• A survey of information-based complexity
• Average complexity of divide-and-conquer algorithms
• An optimal algorithm for search of extrema of a bimodal function
• On the average number of steps of the simplex method of linear programming
• LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
• Printer graphics for clustering
• Parallel minimax search for a maximum
• Sequential Minimax Search for a Maximum When Prior Information is Available
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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