Optimal search algorithm for a minimum of a discrete periodic bimodal function (Q1114409)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1114409 |
scientific article; zbMATH DE number 4082991
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal search algorithm for a minimum of a discrete periodic bimodal function |
scientific article; zbMATH DE number 4082991 |
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
0.967247486114502
0 references
0.8656666278839111
0 references
0.7501369118690491
0 references
0.7320775985717773
0 references
