Accelerating backtrack search with a best-first-search strategy (Q2018417)
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 6424844
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Accelerating backtrack search with a best-first-search strategy |
scientific article; zbMATH DE number 6424844 |
Statements
Accelerating backtrack search with a best-first-search strategy (English)
0 references
14 April 2015
0 references
best-first search
0 references
backtrack
0 references
branch-and-bound
0 references
constraint satisfaction problem
0 references
frequent restarting
0 references
NP-hard problems
0 references
0 references
0.8663362
0 references
0.8587302
0 references
0.8584071
0 references
0.8554363
0 references
0.8545873
0 references
