2018
  [R248] Abstract | PDF | Slides
Filjor Broka, Rina Dechter, Alexander Ihler, and Kalev Kask. "Abstraction Sampling in Graphical Models" in Proceedings of UAI 2018.
2017
  [R241] Abstract | PDF | DOI
William Lam, Kalev Kask, Javier Larrosa, and Rina Dechter. "Subproblem Ordering Heuristics for AND/OR Best-First Search" Journal of Computer and System Sciences (JCSS), volume 94, 2018.

[R240] Abstract | PDF
Rina Dechter, Filjor Broka, Kalev Kask, and Alexander Ihler. "Abstraction Sampling in Graphical Models" Advances in Approximate Bayesian Inference (a workshop of NIPS 2017).
Alternate version: [R240a] Abstract | PDF
Rina Dechter, Filjor Broka, Kalev Kask, and Alexander Ihler. "Sampling over Search Trees Using Abstractions" Southern California Machine Learning Symposium, 2017.

[R236] Abstract | PDF
William Lam, Kalev Kask, Javier Larrosa, and Rina Dechter. "Residual-Guided Look-Ahead in AND/OR Search for Graphical Models" Journal of Artificial Intelligence Research (JAIR), volume 60, 2017.

2016
 

[R232] Abstract | PDF | Poster William Lam, Kalev Kask, Rina Dechter, and Javier Larrosa "On the Impact of Subproblem Orderings on Anytime AND/OR Best-First Search for Lower Bounds" in Proceedings of the European Conference on Artificial Intelligence 2016 (ECAI 2016).
Longer version: [R232a] Abstract | PDF

[R226] Abstract | PDF | Slides Rina Dechter, Kalev Kask, William Lam, and Javier Larrosa. "Look-ahead with Mini-Bucket Heuristics for MPE" in proceedings of AAAI 2016.

2015
 

[R220] Abstract | PDF William Lam, Kalev Kask, and Rina Dechter. "Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation" in Proceedings of the Symposium on Combinatorial Search (SoCS 2015).
Supplemental Experiments: PDF

2014
 

[R212] Abstract | PDF William Lam, Kalev Kask, Rina Dechter, and Alexander Ihler. "Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics" in Proceedings of SoCS 2014.

2012
 

[R196] Abstract | PDF Lars Otten, Alexander Ihler, Kalev Kask, and Rina Dechter. "Winning the PASCAL 2011 MAP Challenge with Enhanced AND/OR Branch-and-Bound" in Proceedings of DISCML 2012 (a workshop of NIPS 2012).

2011
 

[R181] Abstract | PDF | Slides Kalev Kask, Andrew E. Gelfand, Lars Otten, and Rina Dechter. "Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models" in Proceedings of AAAI 2011.

[R180] Abstract | PDF Andrew E. Gelfand, Kalev Kask, and Rina Dechter. "Stopping Rules for Randomized Greedy Triangulation Schemes" in Proceedings of AAAI 2011.

2010
 

[R175] Abstract | PDF Kalev Kask, Rina Dechter, and Andrew E. Gelfand. "BEEM : Bucket Elimination with External Memory" in UAI'2010 Proceedings

2009
 

[R164] Abstract | PDF
Robert Mateescu, Kalev Kask, Vibhav Gogate, and Rina Dechter. "Join-Graph Propagation Algorithms." JAIR'2009

2005
 

[R109] Abstract | PDF
Kalev Kask, Rina Dechter, Javier Larrosa and Avi Dechter. "Unifying Cluster-Tree Decompositions for Reasoning in Graphical Models". In Artificial Intelligence Journal, 2005.

2004
 

[R118] Abstract | PDF
Kalev Kask, Rina Dechter, and Vibhav Gogate. "Counting-Based Look-Ahead Schemes for Constraint Satisfaction". In Constraint Programming, CP'2004.

[R111] Abstract | PDF
Kalev Kask, Rina Dechter and Vibhav Gogate. "New Look-Ahead Schemes for Constraint Satisfaction". In The Eighth International Symposium on Artificial Intelligence and Mathematics, 2004.

2003
 

[R104] Abstract | PDF
Radu Marinescu, Kalev Kask, and Rina Dechter. "Systematic vs. Non-systematic Algorithms for Solving the MPE Task". In UAI 2003.

[R101] Abstract | PostScript | PDF
Rina Dechter, Kalev Kask and Robert Mateescu. "Iterative Join-Graph Propagation", In proceedings of Uncertainty in Artificial Intelligence (UAI 2002), pp. 128-136.

2002
 

[R99] Abstract | PostScript | PDF
Robert Mateescu, Rina Dechter, Kalev Kask. "Tree Approximation for Belief Updating", In proceedings of AAAI-2002.

[R98] Abstract | PostScript | PDF
Rina Dechter, Kalev Kask, Eyal Bin, Roy Emek. "Generating Random Solutions for Constraint Satisfaction Problems", In proceedings of AAAI-2002.

2001
 

K. Kask "Approximation Algorithms for Graphical Models", PhD Thesis. Department of Information and Computer Science, University of California, Irvine.

[R95] Abstract | PostScript | PDF
R. Dechter, K. Kask, J. Larrosa, "A General Scheme for Multiple Lower Bound Computation in Constraint Optimization", Appears in Constraint Programming (CP2001).
Longer version: [R95a] PostScript | PDF

[R94] Abstract | PostScript | PDF
K. Kask, R. Dechter, "A General Scheme for Automatic Generation of Search Heuristics from Specification Dependencies", In Artificial Intelligence 129:91-131, 2001.

[R92] Abstract | PostScript | PDF
K. Kask, R. Dechter, J. Larrosa and F. Cozman, "Bucket-Tree Elimination for Automated Reasoning", ICS Technical Report.
Longer version: [R92a] Abstract | PostScript | PDF

[R91] Abstract | PostScript | PDF
K. Kask, J. Larrosa, R. Dechter, "Up and Down Mini-Buckets: A Scheme for Approximating Combinatorial Optimization Tasks" Technical Report, January, 2001.

2000
 

[R87] Abstract | PostScript | PDF
K. Kask. "New Search Heuristics For Max-CSP" In the proceedings of the "Sixth International Conference on Principles and Practice of Constraint Programming" (CP2000), September, 2000, pp.255-269

[R87a] Abstract | PostScript | PDF
K. Kask, R. Dechter "Using Mini-Bucket Heuristics For Max-CSP" An ICS Technical Report, June, 2000
Longer version: [R86] Abstract |PDF

1999
 

[R79] Abstract | PostScript | PDF
Kask, K., and Dechter, R., "Mini-Bucket Heuristics for Improved Search" In proceedings of "Uncertainty in AI", February, 1999.

[R77] Abstract | PostScript | PDF
Kask, K., and Dechter, R., "Branch and Bound with Mini-Bucket Heuristics" In "International Joint Conference on Artificial Intelligence" (IJCAI99), pp. 426­433, Stockholm, August 1999.

1998
 

[R72] Abstract | PostScript | PDF
K. Kask and R. Dechter, "Stochastic Local Search For Bayesian Networks" In Workshop on "AI and Statistics 99", D. Heckerman and J. Whittaker Ed. Morgan Kaufmann Publishers, pp 113­122, January 1999.

[R71] Abstract | PostScript | PDF
Rish, I., Kask, K., and R. Dechter, "Empirical Evaluation Of Approximation Algorithms For Probabilistic Decoding" In "Uncertainty in AI" (UAI98).

1996
 

[R46] Abstract | PostScript | PDF
Kask, K., and Dechter, R., "Graph-based methods for improving GSAT." In proceedings of "National Conference of Artificial Intelligence" (AAAI-96), Portland, Oregon, August 1996.

1995
 

[R34] Abstract | PostScript | PDF
Kask, K., and Dechter, R., "GSAT and Local Consistency." In "International Joint Conference on Artificial Intelligence" (IJCAI-95), Montreal, Canada, August 1995, pp. 616-622.

1994
 

[R38] Abstract | PostScript | PDF
Schwalb, E., Kask, K., and Dechter, R., "Temporal Reasoning With Constraints On Fluents And Event." In The Twelfth National Conference of Artificial Intelligence" (AAAI-94), Seattle, WA, August 1994, pp. 1067-1072.