Optimal search algorithm for extrema of a discrete periodic bimodal function
type: Item
instance of: scholarly article
title: Optimal search algorithm for extrema of a discrete periodic bimodal function
zbMATH Open document ID: 0673.90091
DOI: 10.1016/0885-064X(89)90006-X
author: Boris S. Veroy
published in: Journal of Complexity
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 4102841
zbMATH Keywords: discrete periodic bimodal function
zbMATH Keywords: Recursive computing
zbMATH Keywords: optimality of the search algorithm
zbMATH Keywords: clustering analysis
zbMATH Keywords: data communication network
MaRDI profile type: Publication
cites work: Q3292915
cites work: Sequential Minimax Search for a Maximum When Prior Information is Available
cites work: Printer graphics for clustering
cites work: Q3835022
cites work: Q4144785
cites work: Parallel minimax search for a maximum
cites work: Q3967358
cites work: Q4164569
cites work: Q5623164
cites work: On the average number of steps of the simplex method of linear programming
cites work: Q3707953
cites work: Q3673103
cites work: Q3883494
cites work: Q4194768
cites work: LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
cites work: Distributed packet switching queueing network design
cites work: An optimal algorithm for search of extrema of a bimodal function
cites work: Average complexity of divide-and-conquer algorithms
cites work: Average case optimality
cites work: A survey of information-based complexity
cites work: Q3664943
description: scientific article; zbMATH DE number 4102841