- New Search Heuristics for Max-CSP. ? Department of Information and Computer Science
- 275B Class Project Empirical evaluations of some benchmark Bayesian
- A General Scheme for Multiple Lower Bound Computation in Constraint Optimization?
- Optimizing with constraints: a case study in scheduling maintenance of electric power units
- Bucket elimination: A unifying framework for probabilistic Rina Dechter
- Tractable Structures for Constraint satisfaction problems Rina Dechter
- A General Scheme for Automatic Generation of Search Heuristics from Specification Dependencies \Lambda
- To Guess or to Think? Hybrid Algorithms for SAT
- Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems.
- Structure Identification in Relational Rina Dechter
- Generating Random Solutions for Constraint Satisfaction Problems Rina Dechter Kalev Kask
- On Combining Graph-based Variance Reduction schemes Vibhav Gogate Rina Dechter
- AND/OR Importance Sampling Vibhav Gogate and Rina Dechter
- Approximate Counting by Sampling the Backtrack-free Search Space Vibhav Gogate and Rina Dechter
- A Complete Anytime Algorithm for Treewidth Vibhav Gogate and Rina Dechter
- A New Algorithm for Sampling CSP Solutions Uniformly at Random
- BucketTree Elimination for Automated Reasoning Kalev Kask, Rina Dechter, Javier Larrosa and Fabio Cozman
- New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence Emma Rollon and Rina Dechter
- AND/OR Graph Search for Genetic Linkage Analysis Radu Marinescu and Rina Dechter
- An Anytime Approximation for Optimizing Policies Under Uncertainty Rina Dechter
- New Look-Ahead Schemes for Constraint Satisfaction Kalev Kask, Rina Dechter and Vibhav Gogate
- SemiIndependent Partitioning: A Method for Bounding the Solution to COP's
- Constraint Restrictiveness versus Local and Global Consistency
- To Guess or to Think? Hybrid Algorithms for SAT
- Constraint processing for optimal maintenance Daniel Frost and Rina Dechter
- Local and Global Relational Consistency Rina Dechter1
- Combining Qualitative and Quantitative Constraints in Temporal Reasoning
- Bucket Elimination: a Unifying Framework for Processing Hard and Soft Constraints
- UNIVERSITY OF CALIFORNIA, Exploiting Graph Cutsets for
- On the impact of causal independence Irina Rish and Rina Dechter
- On finding minimal w-cutset problem Bozhena Bidyuk and Rina Dechter
- Coping With Disjunctions in Temporal Constraint Satisfaction Problems 3
- Iterative Algorithms for Graphical Models 1 Robert Mateescu
- The ffl \Gamma cutset effect in Bayesian networks Bozhena Bidyuk
- MiniBuckets: A General Scheme for Generating Approximations in Automated Reasoning
- Local and Global Relational Consistency Rina Dechter 1 and Peter van Beek 2
- Generating Random Solutions from a Constraint Satisfaction Problem with Controlled Probability
- Bucket Elimination: A Unifying Framework for Rina Dechter
- Let L 1 ;
- c Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Temporal Constraints: A Survey *
- A Constraint View of IBD Graphs Rina Dechter, Dan Geiger and Elizabeth Thompson
- Constraint Satisfaction Rina Dechter
- Epsilon-cutset e ect in Bayesian networks of arbitrary topology
- Uncovering trees in constraint networks Rina Dechter Itay Meiri Judea Pearl
- Hybrid Processing of Beliefs and Constraints \Lambda Rina Dechter and David Larkin
- Bounding Graphical Models Processing by Hypertree Width
- Self-Stabilizing Distributed Constraint Satisfaction Zeev Collin
- Iterative JoinGraph Propagation Rina Dechter Kalev Kask Robert Mateescu
- Bucket Elimination: a Unifying Framework for Processing Hard and Soft Constraints
- Unifying Tree-Decomposition Schemes for Automated Reasoning
- Directional Resolution: The DavisPutnam Procedure, Revisited 3
- Finding All Solutions if You can Find One
- Local and Global Relational Consistency Rina Dechter1
- New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence Emma Rollon and Rina Dechter
- Advancing AND/OR Search for Optimization Using Diverse Principles
- Advancing AND/OR Search for Optimization Using Diverse Principles
- Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems
- Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems
- On the Practical Significance of Hypertree vs. Tree Width Rina Dechter1, Lars Otten1, and Radu Marinescu2
- On the Practical Significance of Hypertree vs Tree Width Rina Dechter1, Lars Otten1, and Radu Marinescu2
- Bounding Search Space Size via (Hyper)tree Decompositions Lars Otten and Rina Dechter
- AND/OR Multi-Valued Decision Diagrams for Constraint Optimization
- UNIVERSITY OF CALIFORNIA, AND/OR Search Spaces for Graphical Models
- AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models
- Studies in Lower Bounding Probability of Evidence using the Markov Vibhav Gogate
- Best-First AND/OR Search for Most Probable Explanations Radu Marinescu and Rina Dechter
- Best-First AND/OR Search for Graphical Models Radu Marinescu and Rina Dechter
- Cutset sampling for Bayesian networks Cutset sampling for Bayesian networks
- A New Algorithm for Sampling CSP Solutions Uniformly at Random
- Compiling Constraint Networks into AND/OR Multi-Valued Decision Diagrams (AOMDDs)
- Improving Bound Propagation Bozhena Bidyuk1 and Rina Dechter2
- Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
- An anytime scheme for bounding posterior beliefs Bozhena Bidyuk and Rina Dechter
- Memory Intensive Branch-and-Bound Search for Graphical Models Radu Marinescu and Rina Dechter
- AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
- AND/OR Cutset Conditioning Robert Mateescu and Rina Dechter
- AND/OR Tree Search for Constraint Optimization Radu Marinescu and Rina Dechter
- Counting-Based Look-Ahead Schemes for Constraint Satisfaction
- The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting
- Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space
- Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
- Semi-Independent Partitioning: A Method for Bounding the Solution to COP's
- A Simple Insight into Iterative Belief Propagation's Success Rina Dechter and Robert Mateescu
- Systematic vs. Non-systematic Algorithms for Solving the MPE Task Radu Marinescu Kalev Kask
- Iterative Join-Graph Propagation Rina Dechter Kalev Kask Robert Mateescu
- Bayesian Inference in the Presence of Determinism David Larkin and Rina Dechter
- Tree Approximation for Belief Updating Robert Mateescu, Rina Dechter and Kalev Kask
- Generating Random Solutions for Constraint Satisfaction Problems Rina Dechter Kalev Kask
- The ; cutset effect in Bayesian networks Bozhena Bidyuk
- Hybrid Processing of Beliefs and Constraints Rina Dechter and David Larkin
- A General Scheme for Automatic Generation of Search Heuristics from Specification Dependencies
- Up and Down Mini-Buckets: A Scheme for Approximating Combinatorial Optimization Tasks
- On the Dual Representation of Non-binary Semiring-based CSPs y
- Boosting Search with Variable Elimination. ? Javier Larrosa
- Using Mini-Bucket Heuristics for Max-CSP Kalev Kask and Rina Dechter
- Title of Publication: Encyclopedia of Cognitive Science. Article title: Constraint Satisfaction.
- Processing Boolean queries over Belief networks Rina Dechter and Padhraic Smyth
- A New Perspective on Algorithms for Optimizing Policies Under Uncertainty
- UNIVERSITY OF CALIFORNIA, EFFICIENT REASONING IN GRAPHICAL MODELS
- Mini-Bucket Heuristics for Improved Search Kalev Kask and Rina Dechter
- 275B Class Project Empirical evaluations of some benchmark Bayesian
- On the Complexity of Interval-Based Constraint Rony Shapiro1, Yishai A. Feldman2, and Rina Dechter3
- UNIVERSITY OF CALIFORNIA Temporal Reasoning with Constraints
- Evaluating Constraint Processing Algorithms Rina Dechter and Daniel Frost
- Mini-Buckets: A General Scheme for Bounded Inference
- Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
- To Guess or to Think? Hybrid Algorithms for SAT
- To Guess or to Think? Hybrid Algorithms for SAT
- To Guess or to Think? Hybrid Algorithms for SAT
- BUCKET ELIMINATION: A UNIFYING FRAMEWORK FOR PROBABILISTIC INFERENCE
- Bucket Elimination: A Unifying Framework for Rina Dechter
- An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
- A Graph-Based Method for Improving GSAT Kalev Kask and Rina Dechter
- Topological Parameters for time-space tradeo Rina Dechter
- Topological Parameters for Time-Space Tradeo Rina Dechter
- Value iteration and policy iteration for Markov decision problem
- Look-ahead value ordering for constraint satisfaction problems Daniel Frost and Rina Dechter
- Constraint Restrictiveness versus Local and Global Consistency
- Dead-end driven learning 3 Daniel Frost and Rina Dechter
- In search of the best constraint satisfaction search 3 Daniel Frost and Rina Dechter
- GSAT and Local Consistency 3 Computer Science Department
- Journal of Arti cial Intelligence Research 3 1995 223-248 Submitted 6 94; published 10 95 Improving Connectionist Energy Minimization
- Ann Math Artif Intell (2008) 54:351 DOI 10.1007/s10472-009-9132-y
- Backtracking algorithms for constraint satisfaction problems
- On the Feasibility of Distributed Constraint Satisfaction Zeev Collin
- Bucket and mini-bucket Schemes for M Best Solutions over Graphical Models Natalia Flerova, Emma Rollon and Rina Dechter
- Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models
- Stopping Rules for Randomized Greedy Triangulation Schemes Andrew E. Gelfand, Kalev Kask and Rina Dechter
- Calculating LOD score: experimental comparison Natalia Flerova
- M best solutions over Graphical Models Natalia Flerova and Rina Dechter
- Load Balancing for Parallel Branch and Bound Lars Otten and Rina Dechter
- Towards Parallel Search for Optimization in Graphical Models Lars Otten and Rina Dechter
- Robust Solutions in Unstable Optimization Maria Silvia Pini1
- AND/OR Branch-and-Bound Search for Combinatorial Optimization in Graphical Models
- Evaluating Partition Strategies for Mini-Bucket Elimination Emma Rollon and Rina Dechter
- Constraint processing for optimal maintenance Daniel Frost and Rina Dechter \Lambda
- Stochastic Local Search for Bayesian Networks Kalev Kask and Rina Dechter
- On the Dual Representation of Nonbinary Semiringbased CSPs \Lambday
- On the Feasibility of Distributed Constraint Satisfaction Zeev Collin
- Bucket elimination: A unifying framework for probabilistic Rina Dechter
- Topological Parameters for timespace tradeoff Rina Dechter
- BUCKET ELIMINATION: A UNIFYING FRAMEWORK FOR PROBABILISTIC INFERENCE
- On the Complexity of IntervalBased Constraint Rony Shapiro 1 , Yishai A. Feldman 2 , and Rina Dechter 3
- Memory Intensive AND/OR Search for Combinatorial Optimization in Graphical Models
- Journal of Artificial Intelligence Research 1 (2009) 1-38 Submitted 10/12; published An Anytime Boosting Scheme for Bounding Posterior
- Compiling Relational Data into Disjunctive Structure: Empirical Evaluation.
- A scheme for approximating probabilistic inference Rina Dechter \Lambda and Irina Rish
- On the Time Complexity of Bucket Elimination Algorithms
- To Guess or to Think? Hybrid Algorithms for SAT
- Unifying TreeDecomposition Schemes for Automated Reasoning
- Up and Down MiniBuckets: A Scheme for Approximating Combinatorial Optimization Tasks
- Processing Boolean queries over Belief networks Rina Dechter and Padhraic Smyth
- Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding
- A General Scheme for Multiple Lower Bound Computation in Constraint Optimization ?
- CONSTRAINT NETWORKS 1 Rina Dechter
- Temporal Reasoning with Constraints on Fluents and Events 3
- GSAT and Local Consistency 3 Computer Science Department
- Processing Disjunctions in Temporal Constraint Networks 3
- Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints
- Topological Parameters for Time-Space Tradeoff
- SampleSearch: Importance Sampling in presence of Determinism Vibhav Gogate,a
- SampleSearch: A Scheme that Searches for Consistent Samples Vibhav Gogate and Rina Dechter
- [ Dechter and Pearl, 1989 ] Rina Dechter and Judea Pearl. Tree clustering for constraint networks. Ar
- Maintenance scheduling problems as benchmarks for constraint algorithms
- Local and Global Relational Consistency Rina Dechter 1 and Peter van Beek 2
- Systematic Versus Stochastic Constraint Satisfaction Eugene C. Freuder \Lambda (Chair)
- Hybrid Processing of Beliefs and Constraints Rina Dechter and David Larkin
- Variable Independence in Markov Decision Problems Irina Rish and Rina Dechter
- Hybrid Processing of Beliefs and Constraints Rina Dechter and David Larkin
- Unifying Cluster-Tree Decompositions for Reasoning in Graphical models
- ELSEVIER Artificial Intelligence 86 ( 1996) 245-267 Intelligence
- Resolution versus Search: Two Strategies for SAT
- Journal of Artificial Intelligence Research 39 (2010) 335-371 Submitted 10/09; published 09/10 Active Tuples-based Scheme for Bounding Posterior Beliefs
- Directional Resolution: The Davis-Putnam Procedure, Revisited
- Looking at Full Looking Ahead \Lambda Daniel Frost and Rina Dechter
- Optimizing with constraints: a case study in scheduling maintenance of electric power units
- Backjump-based Backtracking for Constraint Satisfaction Problems ?
- September 21, 2010 0:4 WSPC -Proceedings Trim Size: 11in x 8.5in psb11-parallel-haplotypes-final FINDING MOST LIKELY HAPLOTYPES IN GENERAL PEDIGREES
- On the Minimality and Global Consistency of Row-Convex Constraint Networks
- An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
- Constraint Satisfaction Rina Dechter
- Evaluating Constraint Processing Algorithms \Lambda Rina Dechter and Daniel Frost
- Diagnosing treedecomposable circuits 3 Yousri El Fattah
- StructureDriven Algorithms for Truth Maintenance 3 Rina Dechter
- [McC86] John McCarthy. Application of circumscription to formaliz ing commonsense knowledge. Artificial Intelligence, 28:89--116,
- Bucket-Tree Elimination for Automated Reasoning Kalev Kask, Rina Dechter, Javier Larrosa and Fabio Cozman
- An Empirical Study of w-Cutset Sampling for Bayesian Networks Bozhena Bidyuk
- The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting
- UNIVERSITY OF CALIFORNIA Algorithms and Heuristics
- Maintenance scheduling problems as benchmarks for constraint algorithms
- Identifying Independencies in Causal Graphs with Feedback Judea Pearl
- REES: Reasoning Engine(s) Evaluation Shell Radu Marinescu, Kalev Kask and Rina Dechter
- Processing Disjunctions in Temporal Constraint Networks 3
- UNIVERSITY OF CALIFORNIA, Sampling Algorithms for Probabilistic Graphical Models with Determinism
- UNIVERSITY OF CALIFORNIA Algorithms and Heuristics
- Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. #
- Value iteration and policy iteration for Markov decision problem
- Epsiloncutset effect in Bayesian networks of arbitrary topology
- Variable Independence in Markov Decision Problems Irina Rish and Rina Dechter
- UNIVERSITY OF CALIFORNIA, EFFICIENT REASONING IN GRAPHICAL MODELS
- Importance Sampling based Estimation over AND/OR Search Spaces for Graphical Models
- Systematic Versus Stochastic Constraint Satisfaction Eugene C. Freuder
- An Anytime Scheme for Bounding Posterior Beliefs Bozhena Bidyuk and Rina Dechter
- Maximum Likelihood Haplotyping through Parallelized Search on a Grid of Computers
- A scheme for approximating probabilistic inference Rina Dechterand Irina Rish
- An Implementation of the Combinatorial Auction Problem in ECLi Robert Menke and Rina Dechter
- New Search Heuristics for MaxCSP. ? Department of Information and Computer Science
- Topological Parameters for TimeSpace Tradeo#
- Topological Parameters for TimeSpace Tradeoff Rina Dechter
- Lookahead value ordering for constraint satisfaction problems \Lambda Daniel Frost and Rina Dechter
- Branch and Bound with Mini-Bucket Heuristics Kalev Kask and Rina Dechter
- Approximate Solution Sampling ( and Counting ) on AND/OR spaces
- Approximate Solution Sampling ( and Counting) on AND/OR search space
- Studies in Solution Sampling Vibhav Gogate and Rina Dechter
- Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding
- Modeling Transportation Routines using Hybrid Dynamic Mixed Networks Vibhav Gogate, Rina Dechter, Bozhena Bidyuk
- UNIVERSITY OF CALIFORNIA Temporal Reasoning with Constraints
- Resolution versus Search: Two Strategies for SAT \Lambda
- In search of the best constraint satisfaction search 3 Daniel Frost and Rina Dechter
- Best-First AND/OR Search for 0/1 Integer Programming Radu Marinescu and Rina Dechter
- Stochastic Local Search for Bayesian Networks Kalev Kask and Rina Dechter
- AND/OR Search Spaces for Graphical Models Rina Dechter
- UNIVERSITY OF CALIFORNIA, AND/OR Search Strategies for Combinatorial Optimization in Graphical Models
- A Comparison of Time-Space Schemes for Graphical Models Robert Mateescu and Rina Dechter
- Memory Intensive AND/OR Search for Combinatorial Optimization in Graphical Models
- Advances in AND/OR Branch-and-Bound Search for Constraint Optimization
- SelfStabilizing Distributed Constraint Satisfaction Zeev Collin
- , , 1--20 () fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- Branch and Bound with MiniBucket Heuristics Kalev Kask and Rina Dechter
- Boosting Search with Variable Elimination. ? Javier Larrosa
- An Implementation of the Combinatorial Auction Problem in ECL i PS e Robert Menke and Rina Dechter
- Backtracking algorithms for constraint satisfaction problems \Lambda
- Compiling Relational Data into Disjunctive Structure: Empirical Evaluation. 3
- Directional Resolution: The DavisPutnam Procedure, Revisited 3
- Coping With Disjunctions in Temporal Constraint Satisfaction Problems 3
- Using MiniBucket Heuristics for MaxCSP \Lambda Kalev Kask and Rina Dechter
- MiniBucket Heuristics for Improved Search Kalev Kask and Rina Dechter
- Directional Resolution: The Davis-Putnam Procedure, Revisited
- Finding All Solutions if You can Find One
- Uncovering trees in constraint networks Rina Dechter Itay Meiri Judea Pearl
- An Anytime Approximation for Optimizing Policies Under Uncertainty Rina Dechter
- A General Scheme for Multiple Lower Bound Computation in Constraint Optimization #
- Cycle-Cutset sampling for Bayesian networks ? Bozhena Bidyuk and Rina Dechter
- A New Perspective on Algorithms for Optimizing Policies Under Uncertainty
- Bayesian Inference in the Presence of Determinism David Larkin and Rina Dechter
- Tree Approximation for Belief Updating Robert Mateescu, Rina Dechter and Kalev Kask
- AND/OR Branch-and-Bound for Graphical Models Radu Marinescu and Rina Dechter
- A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
- Looking at Full Looking Ahead Daniel Frost and Rina Dechter
- Temporal Reasoning with Constraints on Fluents and Events 3
- On the Time Complexity of Bucket Elimination Algorithms
- Artificial Intelligence 113 (1999) 4185 Bucket elimination: A unifying framework
- AND/OR Graph Search for Genetic Linkage Analysis Radu Marinescu and Rina Dechter
- Approximation Algorithms for Probabilistic Reasoning: Sampling and Iterative Inference
- On the Minimality and Global Consistency of RowConvex Constraint Networks 3
- Deadend driven learning 3 Daniel Frost and Rina Dechter
- Combining Qualitative and Quantitative Constraints in Temporal Reasoning \Lambda
- Title of Publication: Encyclopedia of Cognitive Science. Article title: Constraint Satisfaction.
- Evaluating the Impact of AND/OR Search on 0-1 Integer Linear Programming
- Cutset Sampling with Likelihood Weighting Bozhena Bidyuk and Rina Dechter
- BEEM : Bucket Elimination with External Memory Kalev Kask, Rina Dechter and Andrew E. Gelfand
- AND/OR Branch-and-Bound Search for Combinatorial Optimization in Graphical Models
- AND/OR Search Spaces for Graphical Models Rina Dechter and Robert Mateescu
- ARTIFICIAL INTELLIGENCE 273 Enhancement Schemes for Constraint
- Journal of Artificial Intelligence Research 39 (2010) 1-37 Submitted 10/09; published 08/10 Active Tuples-based Scheme for Bounding Posterior Beliefs
- Structure-Driven Algorithms for Truth Maintenance Rina Dechter
- Journal of Artificial Intelligence Research 37 (2010) 279-328 Submitted 05/09; published 03/10 Join-Graph Propagation Algorithms
- On the impact of causal independence Irina Rish and Rina Dechter
- Constraints (2010) 15:2963 DOI 10.1007/s10601-009-9070-7
- Sampling-based Lower Bounds for Counting Queries Vibhav Gogate
- Heuristic Search for m Best Solutions with Applications to Graphical Models
- Inference Schemes for M Best Solutions for Soft CSPs
- Anytime AND/OR Depth-first Search for Combinatorial Optimization Lars Otten and Rina Dechter
- Learning Subproblem Complexities in Distributed Branch and Bound
- HEURISTIC SEARCH FOR M BEST SOLUTIONS WITH APPLICATIONS TO
- Mini-bucket Elimination with Moment Matching Natalia Flerova, Alexander Ihler, Rina Dechter and Lars Otten
- INFERENCE SCHEMES FOR M BEST SOLUTIONS FOR SOFT CSPS
- Pushing the Power of Stochastic Greedy Ordering Schemes for
- Anytime AND/OR Depth-first Search for Combinatorial Optimization
- A System for Exact and Approximate Genetic Linkage Analysis of SNP Data in Large Pedigrees
- On the Power of Belief Propagation: A Constraint Propagation Perspective