An Improved Branch-and-Bound Method for Maximum Monomial Agreement (Q2815448): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: AdaBoost.MH / rank | |||
Normal rank | |||
Revision as of 18:35, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Improved Branch-and-Bound Method for Maximum Monomial Agreement |
scientific article |
Statements
An Improved Branch-and-Bound Method for Maximum Monomial Agreement (English)
0 references
29 June 2016
0 references
branch and bound
0 references
combinatorial optimization
0 references
machine learning
0 references
