Subproblem ordering heuristics for AND/OR best-first search (Q1745717)
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: Subproblem ordering heuristics for AND/OR best-first search |
scientific article; zbMATH DE number 6861260
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subproblem ordering heuristics for AND/OR best-first search |
scientific article; zbMATH DE number 6861260 |
Statements
Subproblem ordering heuristics for AND/OR best-first search (English)
0 references
18 April 2018
0 references
graphical models
0 references
heuristic search
0 references
combinatorial optimization
0 references
artificial intelligence
0 references
0.89728564
0 references
0.85709953
0 references
0.85636294
0 references
0.8530632
0 references
0.84931916
0 references
0.8489454
0 references
0.84722626
0 references
0 references
0.8408632
0 references
0 references
