Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint (Q5094029)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7565996
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint |
scientific article; zbMATH DE number 7565996 |
Statements
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint (English)
0 references
2 August 2022
0 references
uncertainty
0 references
machine learning
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8743680119514465
0 references
0.8742726445198059
0 references
0.8702460527420044
0 references
0.8615492582321167
0 references
0.8583725094795227
0 references
