• Limited discrepancy AND/OR search and its application to optimization tasks in graphical models 

    Larrosa Bondia, Francisco Javier; Rollón Rico, Emma; Dechter, Rina (AAAI Press (Association for the Advancement of Artificial Intelligence), 2016)
    Texto en actas de congreso
    Acceso abierto
    Many combinatorial problems are solved with a Depth-First search (DFS) guided by a heuristic and it is well-known that this method is very fragile with respect to heuristic mistakes. One standard way to make DFS more robust ...
  • Look-ahead with mini-bucket heuristics for MPE 

    Dechter, Rina; Kask, Kalev; Lam, William; Larrosa Bondia, Francisco Javier (AAAI Press (Association for the Advancement of Artificial Intelligence), 2016)
    Comunicación de congreso
    Acceso abierto
    The paper investigates the potential of look-ahead in the con-text of AND/OR search in graphical models using the Mini-Bucket heuristic for combinatorial optimization tasks (e.g., MAP/MPE or weighted CSPs). We present and ...
  • New mini-bucket partitioning heuristics for bounding the probability of evidence 

    Rollón Rico, Emma; Dechter, Rina (2009)
    Texto en actas de congreso
    Acceso abierto
    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)
    Artículo
    Acceso abierto
    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)
    Texto en actas de congreso
    Acceso restringido por política de la 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)
    Artículo
    Acceso restringido por política de la editorial
    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 ...