Heuristics as Markov chains (Q2350029)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Heuristics as Markov chains	scientific article

Statements

scholarly article

0 references

Heuristics as Markov chains (English)

0 references

Carlos Linares López

0 references

Annals of Mathematics and Artificial Intelligence

0 references

publication date

18 June 2015

0 references

zbMATH Keywords

heuristic search

0 references

accuracy of heuristic functions

0 references

N-puzzle

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10472-014-9439-1

0 references

Duality in permutation state spaces and the dual search algorithm

0 references

0 references

0 references

Inconsistent heuristics in theory and practice

0 references

Maximizing over multiple pattern databases speeds up heuristic search

0 references

0 references

Depth-first iterative-deepening: An optimal admissible tree search

0 references

Disjoint pattern database heuristics

0 references

Time complexity of iterative-deepening-\(A^{*}\)

0 references

Graph puzzles, homotopy, and the alternating group

0 references

Predicting optimal solution cost with conditional probabilities

0 references

\(\text{BIDA}^*\): An improved perimeter search algorithm

0 references

0 references

0 references

0 references

Predicting the Performance of IDA* using Conditional Distributions

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10472-014-9439-1

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2350029

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2350029&oldid=35473002"