Pages that link to "Item:Q1045990"
From MaRDI portal
The following pages link to AND/OR branch-and-bound search for combinatorial optimization in graphical models (Q1045990):
Displaying 13 items.
- Concurrent forward bounding for distributed constraint optimization problems (Q359999) (← links)
- Weighted heuristic anytime search: new schemes for optimization over graphical models (Q513336) (← links)
- Multi-dimensional classification with Bayesian networks (Q648355) (← links)
- Learning optimal decision trees using constraint programming (Q823772) (← links)
- AND/OR branch-and-bound search for combinatorial optimization in graphical models (Q1045990) (← links)
- Memory intensive AND/OR search for combinatorial optimization in graphical models (Q1045991) (← links)
- Subproblem ordering heuristics for AND/OR best-first search (Q1745717) (← links)
- An axiomatic framework for influence diagram computation with partially ordered preferences (Q2206449) (← links)
- Evaluating the impact of AND/OR search on 0-1 integer linear programming (Q2267805) (← links)
- Sufficient and necessary conditions for solution finding in valuation-based systems (Q2302788) (← links)
- Structure learning of Bayesian networks using global optimization with applications in data classification (Q2355317) (← links)
- Search algorithms for automated negotiation in large domains (Q6634285) (← links)
- Separate but equal: equality in belief propagation for single-cycle graphs (Q6665729) (← links)
