Exploració per autor "Larrosa Bondia, Francisco Javier"Més informacióMés informació

Ara es mostren els items 1-14 de 14

    • Augmenting the power of (partial) MaxSat resolution with extension 

      Larrosa Bondia, Francisco Javier; Rollón Rico, Emma (AAAI Press, 2020)
      Comunicació de congrés
      Accés restringit per política de l'editorial
      The refutation power of SAT and MaxSAT resolution is challenged by problems like the soft and hard Pigeon Hole Problem PHP for which short refutations do not exist. In this paper we augment the MaxSAT resolution proof ...

    • Choosing the root of the tree decomposition when solving WCSPs: preliminary results 

      Petrova, Aleksandra; Larrosa Bondia, Francisco Javier; Rollón Rico, Emma (IOS Press, 2021)
      Text en actes de congrés
      Accés obert
      In this paper we analyze the effect of selecting the root in a tree decomposition when using decomposition-based backtracking algorithms. We focus on optimization tasks for Graphical Models using the BTD algorithm. We show ...

    • Constraint satisfaction as global optimization 

      Meseguer González, Pedro; Larrosa Bondia, Francisco Javier (1995-06)
      Report de recerca
      Accés obert
      We present an optimization formulation for discrete binary CSP, based on the construction of a continuous function A(P) whose global maximum represents the best possible solution for that problem. By the best possible ...

    • Decomposing utility functions in Bounded Max-Sum for distributed constraint optimization 

      Rollón Rico, Emma; Larrosa Bondia, Francisco Javier (Springer, 2014)
      Text en actes de congrés
      Accés obert
      Bounded Max-Sum is a message-passing algorithm for solving distributed Constraint Optimization Problems (DCOP) able to compute solutions with a guaranteed approximation ratio. In this paper we show that the introduction ...

    • Dinamització d'aules informàtiques a Senegal i Mali 

      Larrosa Bondia, Francisco Javier (2007)
      Pòster (projecte CCD)
      Accés obert

    • Generic CSP techniques for the job-shop problem 

      Larrosa Bondia, Francisco Javier; Meseguer González, Pedro (1997-11)
      Report de recerca
      Accés obert
      The job-shop is a classical problem in manufacturing, arising daily in factories and workshops. From an AI perspective, the job-shop is a constraint satisfaction problem (CSP), and many specific techniques have been developed ...

    • 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)
      Text en actes de congrés
      Accés obert
      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ó de congrés
      Accés obert
      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 ...

    • Partial lazy forward checking 

      Larrosa Bondia, Francisco Javier; Meseguer González, Pedro (1997-11)
      Report de recerca
      Accés obert
      Partial forward checking (PFC) may perform more consistency checks than really needed to detect dead-ends in MAX-CSP. After analyzing PFC, we have identified four causes of redundant check computation: (a) unnecessary ...

    • Proof complexity for the maximum satisfiability problem and its use in SAT refutations 

      Rollón Rico, Emma; Larrosa Bondia, Francisco Javier (Oxford University Press, 2022-10)
      Article
      Accés obert
      MaxSAT, the optimization version of the well-known SAT problem, has attracted a lot of research interest in the past decade. Motivated by the many important applications and inspired by the success of modern SAT solvers, ...

    • 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. ...

    • Solving 'Still life' with soft constraints and bucket elimination 

      Morancho Llena, Enrique; Larrosa Bondia, Francisco Javier (2003-04)
      Report de recerca
      Accés obert
      In this paper we study the aplicability of bucket elimination (BE) to the problem of finding stilllife patterns. Very recently, it has been tackled using integer programming and constraint programming, both of them ...

    • 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 ...