Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

UAI
2008

favoriteEmaildiscussreport

200views Artificial Intelligence» more UAI 2008»

Bounding Search Space Size via (Hyper)tree Decompositions

13 years 6 months ago

Bounding Search Space Size via (Hyper)tree Decompositions

Download uai2008.cs.helsinki.fi

This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to the recent notion of hypertree decompositions allows to exploit determinism in the problem specification and produce tighter bounds. We demonstrate on a variety of practical problem instances that we are often able to improve upon existing bounds by several orders of magnitude.

Lars Otten, Rina Dechter

Real-time Traffic

Artificial Intelligence | Practical Problem Instances | Problem Specification | Tighter Bounds | UAI 2008 |

claim paper

Related Content

» Partial ovoids and partial spreads in hermitian polar spaces

» A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Superta...

» Bounded approximate decentralised coordination via the maxsum algorithm

» Dynamic Trees and Dynamic Point Location

» Compiling Constraint Networks into ANDOR Multivalued Decision Diagrams AOMDDs

» ANDOR MultiValued Decision Diagrams AOMDDs for Graphical Models

» Scalable parallel algorithms for difficult combinatorial problems A case study in optimiza...

» Evaluating hybrid constraint tightening for scheduling agents

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	UAI
Authors	Lars Otten, Rina Dechter

Comments (0)