Pages that link to "Item:Q4178802"
From MaRDI portal
The following pages link to Optimizing decision trees through heuristically guided search (Q4178802):
Displaying 25 items.
- Totally optimal decision trees for Boolean functions (Q323025) (← links)
- General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768) (← links)
- Admissible heuristic search in AND/OR graphs (Q1054163) (← links)
- Admissibility of \(AO^ *\) when heuristics overestimate (Q1102135) (← links)
- Discrete decision theory: manipulations (Q1102136) (← links)
- Generalized best first search using single and multiple heuristics (Q1186365) (← links)
- Integer programs for logic constraint satisfaction (Q1193860) (← links)
- Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search (Q1321063) (← links)
- Concurrent competitive wave approach to hyper-distributed hyper-parallel AI processing (Q1375332) (← links)
- An efficient algorithm for searching implicit AND/OR graphs with cycles (Q1589573) (← links)
- Bi-criteria optimization of decision trees with applications to data analysis (Q1754136) (← links)
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures (Q1837544) (← links)
- Asynchronous heterogeneous mechanism for hyper-distributed hyper-parallel AI processing (Q1964373) (← links)
- Anytime pack search (Q2311238) (← links)
- Strong planning under partial observability (Q2457630) (← links)
- A general heuristic bottom-up procedure for searching AND/OR graphs (Q2639647) (← links)
- An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem (Q2806869) (← links)
- Modelling multicast QoS routing by using best-tree search in and-or graphs and soft constraint logic programming (Q2870287) (← links)
- Weighted Deductive Parsing and Knuth's Algorithm (Q3225400) (← links)
- SCLP for Trust Propagation in Small-World Networks (Q5302723) (← links)
- Optimization and analysis of decision trees and rules: dynamic programming approach (Q5326154) (← links)
- Monitoring and control of anytime algorithms: A dynamic programming approach (Q5940822) (← links)
- LAO*: A heuristic search algorithm that finds solutions with loops (Q5941311) (← links)
- The \(PN^{*}\)-search algorithm: Application to tsume-shogi (Q5941318) (← links)
- A general framework for enumerating equivalence classes of solutions (Q6046942) (← links)
