HEURISTIC SEARCH UNDER CONTRACT
From MaRDI portal
Publication:3224350
DOI10.1111/j.1467-8640.2010.00364.xzbMath1235.68220MaRDI QIDQ3224350
Rajeev Kumar, Sandip Aine, Partha Pratim 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
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Linear-space best-first search
- Depth-first iterative-deepening: An optimal admissible tree search
- Heuristic search in restricted memory
- A complete anytime algorithm for number partitioning
- Deliberation scheduling for problem solving in time-constrained environments
- Optimal sequencing of contract algorithms
- Searching for an optimal path in a tree with random costs
- Heuristic search viewed as path finding in a graph
- Real-time heuristic search
- Weighted heuristic search in networks
- Three approaches to heuristic search in networks
- Branch-and-Bound Methods: A Survey
- Monitoring and control of anytime algorithms: A dynamic programming approach
- Planning as heuristic search
- Time complexity of iterative-deepening-\(A^{*}\)