Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Emma Rollon"'
Publikováno v:
IEEE Access, Vol 9, Pp 142095-142104 (2021)
The aim of this paper is practical: to show that, for at least one important real-world problem, modern SAT-based technology can beat the extremely mature branch-and-cut solving methods implemented in well-known state-of-the-art commercial solvers su
Externí odkaz:
https://doaj.org/article/12e8748c4a554a81bce74d0895cf6711
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
IEEE Access, Vol 9, Pp 142095-142104 (2021)
Universitat Politècnica de Catalunya (UPC)
IEEE Access, Vol 9, Pp 142095-142104 (2021)
The aim of this paper is practical: to show that, for at least one important real-world problem, modern SAT-based technology can beat the extremely mature branch-and-cut solving methods implemented in well-known state-of-the-art commercial solvers su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d710a4e1fabd87ec2ec15ce0758946ee
https://doi.org/10.1109/access.2021.3120597
https://doi.org/10.1109/access.2021.3120597
Publikováno v:
CCIA
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
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 that the choice of the root
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bcabbecdafcccf6beb912cbc1d14a3b8
https://doi.org/10.3233/faia210116
https://doi.org/10.3233/faia210116
Autor:
Emma Rollon, Javier Larrosa
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
AAAI
Universitat Politècnica de Catalunya (UPC)
AAAI
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 system with an extension rule. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43e38439821736a9657143079da3308a
Autor:
Emma Rollon, Javier Larrosa
Publikováno v:
Theory and Applications of Satisfiability Testing – SAT 2020 ISBN: 9783030518240
SAT
SAT
MaxSAT is a very popular language for discrete optimization with many domains of application. While there has been a lot of progress in MaxSAT solvers during the last decade, the theoretical analysis of MaxSAT inference has not followed the pace. Aim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4aea560100b33c40ed842395ff75ab6d
https://doi.org/10.1007/978-3-030-51825-7_16
https://doi.org/10.1007/978-3-030-51825-7_16
Autor:
Emma Rollon, Rina Dechter
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 24:1199-1204
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 bucket, into smaller subsets, c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69598a9e0dd9fd2d4a45058c0c9a78fd
https://doi.org/10.1609/aaai.v24i1.7761
https://doi.org/10.1609/aaai.v24i1.7761
Autor:
Javier Larrosa, Emma Rollon
Publikováno v:
Journal of Heuristics. 12:307-328
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE), a well known dynamic programming generic algorithm, from mono-objecti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41e755219904f3255ec0ee7a6b9d89cb
https://doi.org/10.1007/s10732-006-6726-y
https://doi.org/10.1007/s10732-006-6726-y
Autor:
Javier Larrosa, Emma Rollon
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
Universitat Jaume I
Lecture Notes in Computer Science ISBN: 9783319104270
CP
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
Universitat Jaume I
Lecture Notes in Computer Science ISBN: 9783319104270
CP
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 of an intermediate step that d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51ddfa42165e81cce14ad5e9cb322b4c
http://hdl.handle.net/2117/27089
http://hdl.handle.net/2117/27089
Autor:
Emma Rollon, Javier Larrosa
Publikováno v:
SAC
Bounded Max-Sum is a message-passing algorithm for solving Distributed Constraint Optimization Problems able to compute solutions with a guaranteed approximation ratio. Although its approximate solutions were empirically proved to be within a small p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3761a4130126f467d297c5358bc25b67
https://doi.org/10.1145/2480362.2480383
https://doi.org/10.1145/2480362.2480383
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642294488
GKR
GKR
The paper focuses on the task of generating the first m best solutions for a combinatorial optimization problem defined over a graphical model (e.g., the m most probable explanations for a Bayesian network). We show that the m-best task can be expres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9d6836926d97c81e2066bdfbaa4e22e
https://doi.org/10.1007/978-3-642-29449-5_4
https://doi.org/10.1007/978-3-642-29449-5_4