The following pages link to Rina Dechter (Q513335):
Displayed 50 items.
- Item:Q513335 (redirect page) (← links)
- Weighted heuristic anytime search: new schemes for optimization over graphical models (Q513336) (← links)
- SampleSearch: importance sampling in presence of determinism (Q543621) (← links)
- Mixed deterministic and probabilistic networks (Q841632) (← links)
- Decomposing a relation into a tree of binary relations (Q909447) (← links)
- AND/OR search spaces for graphical models (Q1028898) (← 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)
- Network-based heuristics for constraint-satisfaction problems (Q1102137) (← links)
- Tree clustering for constraint networks (Q1116363) (← links)
- Probabilistic analysis of the complexity of A* (Q1146526) (← links)
- Temporal constraint networks (Q1182161) (← links)
- From local to global consistency (Q1193482) (← links)
- Structure identification in relational data (Q1204870) (← links)
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems (Q1332852) (← links)
- On computing minimal models (Q1380414) (← links)
- Local and global relational consistency (Q1391940) (← links)
- Processing disjunctions in temporal constraint networks (Q1402717) (← links)
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems (Q1424768) (← links)
- Heuristic search in artificial intelligence (Q1603450) (← links)
- Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
- Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs (Q1706596) (← links)
- Importance sampling-based estimation over AND/OR search spaces for graphical models (Q1761277) (← links)
- Propositional semantics for disjunctive logic programs (Q1924819) (← links)
- Resolution versus search: Two strategies for SAT (Q1977760) (← links)
- Maintenance scheduling problems as benchmarks for constraint algorithms (Q1978021) (← links)
- Bucket elimination: A unifying framework for reasoning (Q1978379) (← links)
- Default reasoning using classical logic (Q2171265) (← links)
- Evaluating the impact of AND/OR search on 0-1 integer linear programming (Q2267805) (← links)
- Bucket elimination: a unifying framework for processing hard and soft constraints (Q2348610) (← links)
- Unifying tree decompositions for reasoning in graphical models (Q2457660) (← links)
- Structure-driven algorithms for truth maintenance (Q2674194) (← links)
- Uncovering trees in constraint networks (Q2676569) (← links)
- (Q2749860) (← links)
- Searching for the M Best Solutions in Graphical Models (Q2800960) (← links)
- (Q2996252) (← links)
- Active Tuples-based Scheme for Bounding Posterior Beliefs (Q3055808) (← links)
- Anytime AND/OR depth-first search for combinatorial optimization (Q3164973) (← links)
- Mini-buckets (Q3455559) (← links)
- (Q3489503) (← links)
- (Q3493325) (← links)
- AND/OR Multi-valued Decision Diagrams for Constraint Networks (Q3507367) (← links)
- AND/OR Multi-valued Decision Diagrams for Constraint Optimization (Q3523076) (← links)
- Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs) (Q3524247) (← links)
- Join-Graph Propagation Algorithms (Q3563087) (← links)
- Best-First AND/OR Search for 0/1 Integer Programming (Q3612417) (← links)
- (Q3624045) (← links)
- (Q3624169) (← links)
- Generalized best-first search strategies and the optimality of A* (Q3768428) (← links)
- (Q3835053) (← links)