Optimizing decision trees through heuristically guided search
From MaRDI portal
Publication:4178802
DOI10.1145/359657.359664zbMATH Open0395.90079OpenAlexW1970515221MaRDI QIDQ4178802FDOQ4178802
Alberto Martelli, Ugo Montanari
Publication date: 1978
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359657.359664
Applications of mathematical programming (90C90) Decision theory (91B06) Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Applications of graph theory to circuits and networks (94C15)
Cited In (25)
- A general framework for enumerating equivalence classes of solutions
- The \(PN^{*}\)-search algorithm: Application to tsume-shogi
- An efficient algorithm for searching implicit AND/OR graphs with cycles
- Discrete decision theory: manipulations
- Strong planning under partial observability
- Anytime pack search
- General branch and bound, and its relation to \(A^*\) and \(AO^*\)
- Monitoring and control of anytime algorithms: A dynamic programming approach
- SCLP for Trust Propagation in Small-World Networks
- Weighted Deductive Parsing and Knuth's Algorithm
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
- LAO*: A heuristic search algorithm that finds solutions with loops
- Totally optimal decision trees for Boolean functions
- Optimization and analysis of decision trees and rules: dynamic programming approach
- Integer programs for logic constraint satisfaction
- An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem
- Generalized best first search using single and multiple heuristics
- Admissible heuristic search in AND/OR graphs
- Asynchronous heterogeneous mechanism for hyper-distributed hyper-parallel AI processing
- Bi-criteria optimization of decision trees with applications to data analysis
- Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
- Modelling multicast QoS routing by using best-tree search in and-or graphs and soft constraint logic programming
- Concurrent competitive wave approach to hyper-distributed hyper-parallel AI processing
- A general heuristic bottom-up procedure for searching AND/OR graphs
- Admissibility of \(AO^ *\) when heuristics overestimate
This page was built for publication: Optimizing decision trees through heuristically guided search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178802)
