A formal analysis of why heuristic functions work

DOI10.1016/j.artint.2002.02.001zbMath1132.68708OpenAlexW1977283395WikidataQ60327980 ScholiaQ60327980MaRDI QIDQ2457670

Luis G. Rueda, B. John Oommen

Publication date: 23 October 2007

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2002.02.001

zbMATH Keywords

optimizationpattern recognitionheuristic algorithmsA\(^*\) algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Statistical profile estimation in database systems
• Graph partitioning using learning automata
• The Efficiency of Histogram-like Techniques for Database Query Optimization
• Learning Automata - A Survey

This page was built for publication: A formal analysis of why heuristic functions work