Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms (Q1777602)
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: Efficient partition of N-dimensional intervals in the framework of one-point-based algorithms |
scientific article; zbMATH DE number 2171464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms |
scientific article; zbMATH DE number 2171464 |
Statements
Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms (English)
0 references
24 May 2005
0 references
Partitioning
0 references
minimal description
0 references
one-point-based algorithms
0 references
global optimization
0 references
0 references
0 references
0 references
0 references
0.9129095077514648
0 references
0.7221425771713257
0 references
0.7168745398521423
0 references
