Heuristic search under contract

DOI10.1111/J.1467-8640.2010.00364.XMaRDI QIDQ3224350zbMATH OpenOpenAlexFDO

Authors Sandip Aine, Rajeev Kumar, P. P. Chakrabarti

Publication date 30 March 2012

Published in Computational Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1467-8640.2010.00364.x

zbMATH Keywords

anytime algorithmscontract algorithmsheuristic searchprobabilistic reasoning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Contract Search: heuristic search under node expansion constraints
• Anytime heuristic search
• Heuristic search in restricted memory
• scientific article; zbMATH DE number 5547847
• Effective heuristics for suboptimal best-first search

Cites work

• A complete anytime algorithm for number partitioning
• Branch-and-Bound Methods: A Survey
• Deliberation scheduling for problem solving in time-constrained environments
• Depth-first iterative-deepening: An optimal admissible tree search
• Heuristic search in restricted memory
• Heuristic search viewed as path finding in a graph
• scientific article; zbMATH DE number 5547847 (Why is no real title available?)
• Learning in real-time search: a unifying framework
• Linear-space best-first search
• Monitoring and control of anytime algorithms: A dynamic programming approach
• Optimal sequencing of contract algorithms
• Planning as heuristic search
• Real-time heuristic search
• Searching for an optimal path in a tree with random costs
• Three approaches to heuristic search in networks
• Time complexity of iterative-deepening-\(A^{*}\)
• Weighted heuristic search in networks

Cited in

(1)

• Contract Search: heuristic search under node expansion constraints

This page was built for publication: Heuristic search under contract

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