Learning heuristics in search problems

MaRDI QIDQ1842675zbMATH OpenFDO

Authors Ye. N. Orel

Publication date 3 March 1997

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

zbMATH Keywords

Nilsson algorithmself-learning algorithmsshortest-path search problems

Mathematics Subject Classification ID

Searching and sorting (68P10) Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)

Recommendations

• Learning for efficient search
• Heuristic search and related boundary value problems
• Learning heuristic functions for large state spaces
• Three approaches to heuristic search in networks
• Real-time heuristic search

Cited in

(14)

• Accelerating autonomous learning by using heuristic selection of actions
• New approaches for heuristic search: A bilateral linkage with artificial intelligence
• Optimal search with learning
• Heuristic search and related boundary value problems
• A connectionist approach for learning search-control heuristics for automated deduction systems (Thesis, TU München, 1997)
• Value Prediction in Engineering Applications
• Heuristic approach to the artificial intelligence design challenge
• Learning heuristic functions for large state spaces
• scientific article; zbMATH DE number 1154599 (Why is no real title available?)
• scientific article; zbMATH DE number 1548192 (Why is no real title available?)
• scientific article; zbMATH DE number 4119687 (Why is no real title available?)
• scientific article; zbMATH DE number 800043 (Why is no real title available?)
• Search algorithms at ACM contests
• Learning for efficient search

This page was built for publication: Learning heuristics in search problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1842675)