Optimal search algorithm for a minimum of a discrete periodic bimodal function (Q1114409): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3292915 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3967358 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3883494 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Distributed packet switching queueing network design / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal algorithm for search of extrema of a bimodal function / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Average complexity of divide-and-conquer algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4058519 / rank | |||
Normal rank | |||
Latest revision as of 10:36, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal search algorithm for a minimum of a discrete periodic bimodal function |
scientific article |
Statements
Optimal search algorithm for a minimum of a discrete periodic bimodal function (English)
0 references
1988
0 references
This paper describes an optimal algorithm for searching for a minimum of a discrete periodic bimodal function of period P. Recursive computing is used to prove the optimality of the search algorithm. An application of the algorithm for a partition analysis of a communication network is provided.
0 references
partition analysis
0 references
information-based complexity
0 references
optimal algorithm
0 references
search
0 references
communication network
0 references
