| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Kalev Kask, Rina Dechter, Andrew Gelfand |
BEEM : Bucket Elimination with External Memory  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Vibhav Gogate, Rina Dechter |
Importance sampling-based estimation over AND/OR search spaces for graphical models. |
Artif. Intell. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bozhena Bidyuk, Rina Dechter |
Cutset Sampling for Bayesian Networks |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Vibhav Gogate, Rina Dechter |
SampleSearch: Importance sampling in presence of determinism. |
Artif. Intell. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vibhav Gogate, Rina Dechter |
Sampling-based lower bounds for counting queries. |
Intelligenza Artificiale |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Otten, Rina Dechter |
Anytime AND/OR Depth-First Search for Combinatorial Optimization. |
SOCS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Lars Otten, Rina Dechter |
Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing. |
Pacific Symposium on Biocomputing |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrew Gelfand, Kalev Kask, Rina Dechter |
Stopping Rules for Randomized Greedy Triangulation Schemes. |
AAAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kalev Kask, Andrew Gelfand, Lars Otten, Rina Dechter |
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models. |
AAAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Radu Marinescu 0002, Rina Dechter |
Evaluating the impact of AND/OR search on 0-1 integer linear programming. |
Constraints |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vibhav Gogate, Rina Dechter |
On Combining Graph-based Variance Reduction schemes. |
Journal of Machine Learning Research - Proceedings Track |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bozhena Bidyuk, Rina Dechter, Emma Rollon |
Active Tuples-based Scheme for Bounding Posterior Beliefs. |
J. Artif. Intell. Res. (JAIR) |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter |
Join-Graph Propagation Algorithms. |
J. Artif. Intell. Res. (JAIR) |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Emma Rollon, Rina Dechter |
Evaluating partition strategies for mini-bucket elimination. |
ISAIM |
2010 |
DBLP BibTeX RDF |
|
| 1 | Lars Otten, Rina Dechter |
Toward parallel search for optimization in graphical models. |
ISAIM |
2010 |
DBLP BibTeX RDF |
|
| 1 | Kalev Kask, Rina Dechter, Andrew Gelfand |
BEEM : Bucket Elimination with External Memory. |
UAI |
2010 |
DBLP BibTeX RDF |
|
| 1 | Emma Rollon, Rina Dechter |
New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence. |
AAAI |
2010 |
DBLP BibTeX RDF |
|
| 1 | Radu Marinescu 0002, Rina Dechter |
Memory intensive AND/OR search for combinatorial optimization in graphical models. |
Artif. Intell. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Radu Marinescu 0002, Rina Dechter |
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models. |
Artif. Intell. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Mateescu, Rina Dechter, Radu Marinescu 0002 |
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. |
J. Artif. Intell. Res. (JAIR) |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Mateescu, Rina Dechter |
Mixed deterministic and probabilistic networks. |
Ann. Math. Artif. Intell. |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 68T30, 62F30, 62F15, 68T37, 68T20 |
| 1 | Rina Dechter, Lars Otten, Radu Marinescu 0002 |
On the Practical Significance of Hypertree vs. TreeWidth. |
ECAI |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Rina Dechter |
Robust Solutions in Unstable Optimization Problems. |
CSCLP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Mateescu, Rina Dechter |
AND/OR Multi-valued Decision Diagrams for Constraint Networks. |
Concurrency, Graphs and Models |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vibhav Gogate, Rina Dechter |
AND/OR Importance Sampling. |
UAI |
2008 |
DBLP BibTeX RDF |
|
| 1 | Lars Otten, Rina Dechter |
Bounding Search Space Size via (Hyper)tree Decompositions. |
UAI |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vibhav Gogate, Rina Dechter |
Studies in Solution Sampling. |
AAAI |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vibhav Gogate, Rina Dechter |
Approximate Solution Sampling (and Counting) on AND/OR Spaces. |
CP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Otten, Rina Dechter |
Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. |
CP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vibhav Gogate, Rina Dechter |
SampleSearch: A Scheme that Searches for Consistent Samples. |
Journal of Machine Learning Research - Proceedings Track |
2007 |
DBLP BibTeX RDF |
|
| 1 | Bozhena Bidyuk, Rina Dechter |
Cutset Sampling for Bayesian Networks. |
J. Artif. Intell. Res. (JAIR) |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Rina Dechter, Robert Mateescu |
AND/OR search spaces for graphical models. |
Artif. Intell. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Mateescu, Rina Dechter |
A Comparison of Time-Space Schemes for Graphical Models. |
IJCAI |
2007 |
DBLP BibTeX RDF |
|
| 1 | Radu Marinescu 0002, Rina Dechter |
Best-First AND/OR Search for 0/1 Integer Programming. |
CPAIOR |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Radu Marinescu 0002, Rina Dechter |
Best-First AND/OR Search for Most Probable Explanations. |
UAI |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vibhav Gogate, Bozhena Bidyuk, Rina Dechter |
Studies in Lower Bounding Probabilities of Evidence using the Markov Inequality. |
UAI |
2007 |
DBLP BibTeX RDF |
|
| 1 | Robert Mateescu, Rina Dechter |
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models. |
UAI |
2007 |
DBLP BibTeX RDF |
|
| 1 | Radu Marinescu 0002, Rina Dechter |
Best-First AND/OR Search for Graphical Models. |
AAAI |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vibhav Gogate, Rina Dechter |
Approximate Counting by Sampling the Backtrack-free Search Space. |
AAAI |
2007 |
DBLP BibTeX RDF |
|
| 1 | Robert Mateescu, Radu Marinescu 0002, Rina Dechter |
AND/OR Multi-valued Decision Diagrams for Constraint Optimization. |
CP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bozhena Bidyuk, Rina Dechter |
Improving Bound Propagation. |
ECAI |
2006 |
DBLP BibTeX RDF |
|
| 1 | Radu Marinescu 0002, Rina Dechter |
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models. |
ECAI |
2006 |
DBLP BibTeX RDF |
|
| 1 | Radu Marinescu 0002, Rina Dechter |
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems. |
CPAIOR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bozhena Bidyuk, Rina Dechter |
Cutset Sampling with Likelihood Weighting. |
UAI |
2006 |
DBLP BibTeX RDF |
|
| 1 | Bozhena Bidyuk, Rina Dechter |
An Anytime Scheme for Bounding Posterior Beliefs. |
AAAI |
2006 |
DBLP BibTeX RDF |
|
| 1 | Radu Marinescu 0002, Rina Dechter |
Memory Intensive Branch-and-Bound Search for Graphical Models. |
AAAI |
2006 |
DBLP BibTeX RDF |
|
| 1 | Robert Mateescu, Rina Dechter |
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs). |
CP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vibhav Gogate, Rina Dechter |
A New Algorithm for Sampling CSP Solutions Uniformly at Random. |
CP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kalev Kask, Rina Dechter, Javier Larrosa, Avi Dechter |
Unifying tree decompositions for reasoning in graphical models. |
Artif. Intell. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Radu Marinescu 0002, Rina Dechter |
AND/OR Branch-and-Bound for Graphical Models. |
IJCAI |
2005 |
DBLP BibTeX RDF |
|
| 1 | Robert Mateescu, Rina Dechter |
AND/OR Cutset Conditioning. |
IJCAI |
2005 |
DBLP BibTeX RDF |
|
| 1 | Vibhav Gogate, Rina Dechter, Bozhena Bidyuk, Craig Rindt, James Marca |
Modeling Transportation Routines using Hybrid Dynamic Mixed Networks. |
UAI |
2005 |
DBLP BibTeX RDF |
|
| 1 | Vibhav Gogate, Rina Dechter |
Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints. |
UAI |
2005 |
DBLP BibTeX RDF |
|
| 1 | Robert Mateescu, Rina Dechter |
The Relationship Between AND/OR Search and Variable Elimination. |
UAI |
2005 |
DBLP BibTeX RDF |
|
| 1 | Radu Marinescu 0002, Rina Dechter |
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems. |
CP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Mateescu, Rina Dechter |
AND/OR Search Spaces and the Semantic Width of Constraint Networks. |
CP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kalev Kask, Rina Dechter, Vibhav Gogate |
New Look-Ahead Schemes for Constraint Satisfaction. |
ISAIM |
2004 |
DBLP BibTeX RDF |
|
| 1 | Rina Dechter |
Constraints and Probabilistic Networks: A Look At The Interface. |
LPNMR |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vibhav Gogate, Rina Dechter |
A Complete Anytime Algorithm for Treewidth. |
UAI |
2004 |
DBLP BibTeX RDF |
|
| 1 | Bozhena Bidyuk, Rina Dechter |
On Finding Minimal w-cutset. |
UAI |
2004 |
DBLP BibTeX RDF |
|
| 1 | Rina Dechter, Robert Mateescu |
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space. |
UAI |
2004 |
DBLP BibTeX RDF |
|
| 1 | Kalev Kask, Rina Dechter, Vibhav Gogate |
New Look-Ahead Schemes for Constraint Satisfaction. |
AMAI |
2004 |
DBLP BibTeX RDF |
|
| 1 | Kalev Kask, Rina Dechter, Vibhav Gogate |
Counting-Based Look-Ahead Schemes for Constraint Satisfaction. |
CP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rina Dechter, Robert Mateescu |
The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting. |
CP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rina Dechter |
Guest Editorial. |
Constraints |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Larrosa, Rina Dechter |
Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. |
Constraints |
2003 |
DBLP DOI BibTeX RDF |
bucket elimination, constraint satisfaction, branch and bound, soft constraints, constraint optimization |
| 1 | Rina Dechter, Irina Rish |
Mini-buckets: A general scheme for bounded inference. |
J. ACM |
2003 |
DBLP DOI BibTeX RDF |
Accuracy/complexity trade-off, approximation algorithms, Bayesian networks, combinatorial optimization, probabilistic inference |
| 1 | Rina Dechter |
Constraint processing. |
|
2003 |
RDF |
|
| 1 | Rina Dechter, Robert Mateescu |
A Simple Insight into Iterative Belief Propagation's Success. |
UAI |
2003 |
DBLP BibTeX RDF |
|
| 1 | Bozhena Bidyuk, Rina Dechter |
An Empirical Study of w-Cutset Sampling for Bayesian Networks. |
UAI |
2003 |
DBLP BibTeX RDF |
|
| 1 | Radu Marinescu 0002, Kalev Kask, Rina Dechter |
Systematic vs. Non-systematic Algorithms for Solving the MPE Task. |
UAI |
2003 |
DBLP BibTeX RDF |
|
| 1 | Bozhena Bidyuk, Rina Dechter |
Cycle-Cutset Sampling for Bayesian Networks. |
Canadian Conference on AI |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rina Dechter, Daniel Frost |
Backjump-based backtracking for constraint satisfaction problems. |
Artif. Intell. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rina Dechter, Kalev Kask, Robert Mateescu |
Iterative Join-Graph Propagation. |
UAI |
2002 |
DBLP BibTeX RDF |
|
| 1 | Rina Dechter, Richard S. Sutton (eds.) |
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28 - August 1, 2002, Edmonton, Alberta, Canada. |
AAAI |
2002 |
DBLP BibTeX RDF |
|
| 1 | Robert Mateescu, Rina Dechter, Kalev Kask |
Tree Approximation for Belief Updating. |
AAAI/IAAI |
2002 |
DBLP BibTeX RDF |
|
| 1 | Rina Dechter, Kalev Kask, Eyal Bin, Roy Emek |
Generating Random Solutions for Constraint Satisfaction Problems. |
AAAI/IAAI |
2002 |
DBLP BibTeX RDF |
|
| 1 | Weixiong Zhang, Rina Dechter, Richard E. Korf |
Heuristic search in artificial intelligence. |
Artif. Intell. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Kalev Kask, Rina Dechter |
A general scheme for automatic generation of search heuristics from specification dependencies. |
Artif. Intell. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rina Dechter, Yousri El Fattah |
Topological parameters for time-space tradeoff. |
Artif. Intell. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rina Dechter, David Larkin |
Hybrid Processing of Beliefs and Constraints. |
UAI |
2001 |
DBLP BibTeX RDF |
|
| 1 | Rina Dechter, Kalev Kask, Javier Larrosa |
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization. |
CP |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Irina Rish, Rina Dechter |
Resolution versus Search: Two Strategies for SAT. |
J. Autom. Reasoning |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Rina Dechter |
A New Perspective on Algorithms for Optimizing Policies under Uncertainty. |
AIPS |
2000 |
DBLP BibTeX RDF |
|
| 1 | Robert Menke, Rina Dechter |
An Implementation of the Combinatorial Auction Problem in ECLiPSe. |
AAAI/IAAI |
2000 |
DBLP BibTeX RDF |
|
| 1 | Rina Dechter (eds.) |
Principles and Practice of Constraint Programming - CP 2000, 6th International Conference, Singapore, September 18-21, 2000, Proceedings |
CP |
2000 |
DBLP BibTeX RDF |
|
| 1 | Zeev Collin, Rina Dechter, Shmuel Katz |
Self-Stabilizing Distributed Constraint Satisfaction. |
Chicago J. Theor. Comput. Sci. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Rina Dechter |
Bucket Elimination: A Unifying Framework for Reasoning. |
Artif. Intell. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Frost, Rina Dechter |
Maintenance scheduling problems as benchmarks for constraint algorithms. |
Ann. Math. Artif. Intell. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Kalev Kask, Rina Dechter |
Branch and Bound with Mini-Bucket Heuristics. |
IJCAI |
1999 |
DBLP BibTeX RDF |
|
| 1 | Kalev Kask, Rina Dechter |
Mini-Bucket Heuristics for Improved Search. |
UAI |
1999 |
DBLP BibTeX RDF |
|
| 1 | Irina Rish, Kalev Kask, Rina Dechter |
Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding. |
UAI |
1998 |
DBLP BibTeX RDF |
|
| 1 | Daniel Frost, Rina Dechter |
Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units. |
CP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Rina Dechter, Peter van Beek |
Local and Global Relational Consistency. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rina Dechter |
Bucket Elimination: a Unifying Framework for Processing Hard and Soft Constraints. |
Constraints |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter van Beek, Rina Dechter |
Constraint tightness and looseness versus local and global consistency. |
J. ACM |
1997 |
DBLP DOI BibTeX RDF |
constraint satisfaction problems, relations, local consistency, constraint networks, constraint-based reasoning |
| 1 | Eddie Schwalb, Rina Dechter |
Processing Disjunctions in Temporal Constraint Networks. |
Artif. Intell. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rina Dechter |
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning. |
IJCAI |
1997 |
DBLP BibTeX RDF |
|
| 1 | Arun K. Jagota, Rina Dechter |
Simple distributed algorithms for the cycle cutset problem. |
SAC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rina Dechter, Irina Rish |
A Scheme for Approximating Probabilistic Inference. |
UAI |
1997 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")