Exploració per autor "Dechter, Rina"

Ara es mostren els items 3-6 de 6

    • New mini-bucket partitioning heuristics for bounding the probability of evidence 

      Rollón Rico, Emma; Dechter, Rina (2009)
      Text en actes de congrés
      Accés obert
      Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure that partitions a set of functions, called ...

    • Residual-guided look-ahead in AND/OR search for graphical models 

      Lam, William; Kask, Kalev; Larrosa Bondia, Francisco Javier; Dechter, Rina (2017-10-01)
      Article
      Accés obert
      We introduce the concept of local bucket error for the mini-bucket heuristics and show how it can be used to improve the power of AND/OR search for combinatorial optimization tasks in graphical models (e.g. MAP/MPE or ...

    • Semiring-based mini-bucket partitioning schemes 

      Rollón Rico, Emma; Larrosa Bondia, Francisco Javier; Dechter, Rina (AAAI Press. Association for the Advancement of Artificial Intelligence, 2013)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      Graphical models are one of the most prominent frameworks to model complex systems and efficiently query them. Their underlying algebraic properties are captured by a valuation structure that, most usually, is a semiring. ...

    • Subproblem ordering heuristics for AND/OR best-first search 

      Lam, William; Kask, Kalev; Larrosa Bondia, Francisco Javier; Dechter, Rina (2017-11-09)
      Article
      Accés obert
      Best-first search can be regarded as anytime scheme for producing lower bounds on the optimal solution, a characteristic that is mostly overlooked. We explore this topic in the context of AND/OR best-first search, guided ...