A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems (Q1266611)
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: A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems |
scientific article; zbMATH DE number 1208559
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems |
scientific article; zbMATH DE number 1208559 |
Statements
A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems (English)
0 references
7 October 1998
0 references
inductive learning
0 references
efficiency
0 references
effectiveness
0 references
0 references
0.8758023
0 references
0 references
0.87271565
0 references
0.8724012
0 references
0.86635435
0 references
