Dechter_R: 54 documents, from the least to the most probable paper
Perplexity score: Title:
3707.915186 The eta-cutset effect in Bayesian networks
3348.051901 Identifying Independencies in Causal Graphs with Feedback
3346.899005 Partition-based Anytime Approximation for Belief Updating
3152.535471 Finding All Solutions if You can Find One
3036.631328 Approximation Algorithms for Probabilistic Decoding
2649.247869 Self-Stabilizing Distributed Constraint Satisfaction
2641.672938 On the Feasibility of Distributed Constraint Satisfaction
2575.736458 Directional Resolution: The Davis-Putnam Procedure, Revisited
2492.490551 Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding
2468.038343 Self-stabilizing Distributed Constraint Satisfaction
2460.826048 Uncovering Trees in Constraint Networks
2393.321078 Systematic Versus Stochastic Constraint Satisfaction
2207.197310 Propositional Semantics for Disjunctive Logic Programs
2202.463671 Improving Connectionist Energy Minimization
2179.665183 Empirical evaluation of two versions of the Davis-Putnam algorithm
1937.215989 Branch and Bound with Mini-Bucket Heuristics
1884.701235 Diagnosing tree-decomposable circuits
1780.853837 Temporal Reasoning with Constraints on Fluents and Events
1765.258076 On the Impact of Causal Independence
1680.069676 Bucket-Tree Elimination for Automated Reasoning
1668.667195 Compiling Relational Data into Disjunctive Structure: Empirical Evaluation
1538.613266 To Guess or to Think? Hybrid Algorithms for SAT
1506.039237 Coping With Disjunctions in Temporal Constraint Satisfaction Problems
1493.843094 Default reasoning using classical logic
1489.542462 A New Perspective on Algorithms for Optimizing Policies Under Uncertainty
1486.439165 Topological Parameters for Time-Space Tradeoff
1485.672085 Up and Down Mini-Buckets: A Scheme for Approximating Combinatorial Optimization Tasks
1467.002968 On the impact of causal independence
1434.021194 Mini-Bucket Heuristics for Improved Search
1429.354669 Evaluating Constraint Processing Algorithms
1389.168534 A General Scheme for Automatic Generation of Search Heuristics from Specification Dependencies
1367.310199 Mini-buckets: a general scheme for approximating inference
1345.164126 Constraint Restrictiveness versus Local and Global Consistency
1334.499031 A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
1310.313749 Constraint Tightness and Looseness versus Local and Global Consistency
1289.718928 Local and Global Relational Consistency
1197.042313 Mini-buckets: a general scheme for approximating inference
1168.286066 Inference in Inheritance Networks using Propositional Logic and Constraint Networks Techniques
1129.539698 Dead-end driven learning
1099.115473 Constraint Tightness versus Global Consistency
1080.613882 Unifying Tree-Decomposition Schemes for Automated Reasoning
1072.102137 Optimizing with constraints: a case study in scheduling maintenance of electric power units
1071.793120 A Mini-Bucket-Based Scheme for Approximating Combinatorial Optimization Tasks: Preliminary results
1019.211072 Using Mini-Bucket Heuristics for Max-CSP
1001.961604 Bucket Elimination: a Unifying Framework for Structure-driven Inference
981.657687 Hybrid Processing of Beliefs and Constraints
928.494434 Processing Temporal Constraint Networks
915.847807 Dynamic Combination of Search and Variable Elimination in CSP and Max-CSP
912.277613 Maintenance scheduling problems as benchmarks for constraint algorithms
809.560976 GSAT and Local Consistency
763.211555 Backtracking algorithms for constraint satisfaction problems
623.823207 In search of the best constraint satisfaction search
547.582240 Backtracking algorithms for constraint satisfaction problems - a tutorial survey
547.582240 Backtracking algorithms for constraint satisfaction problems - a survey