Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search (Q4589262)
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: Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search |
scientific article; zbMATH DE number 6805060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search |
scientific article; zbMATH DE number 6805060 |
Statements
Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search (English)
0 references
10 November 2017
0 references
heuristic search
0 references
bidirectional search
0 references
permutation sorting
0 references
0.7473410964012146
0 references
0.7442933320999146
0 references
0.7187824249267578
0 references
0.7151459455490112
0 references
0.7151457071304321
0 references
