Optimal search algorithm for a minimum of a discrete periodic bimodal function (Q1114409): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(88)90115-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2040046436 / rank | |||
Normal rank | |||
Revision as of 20:29, 19 March 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
