Optimizing decision trees through heuristically guided search
From MaRDI portal
(Redirected from Publication:4178802)
Cited in
(24)- Admissibility of \(AO^ *\) when heuristics overestimate
- 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
- General branch and bound, and its relation to A^* and AO^*
- Anytime pack search
- Weighted Deductive Parsing and Knuth's Algorithm
- Monitoring and control of anytime algorithms: A dynamic programming approach
- SCLP for Trust Propagation in Small-World Networks
- 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
- Integer programs for logic constraint satisfaction
- Optimization and analysis of decision trees and rules: dynamic programming approach
- 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
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)
