Positive Plücker tree certificates for non-realizability

Autor: Pfeifle, Julián

Publikováno v: Experimental Mathematics. :1-17

We introduce a new method for finding a non-realizability certificate of a simplicial sphere S: we exhibit a monomial combination of classical 3-term Pl¨ucker relations that yields a sum of products of determinants that are known to be positive in a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::024e2b197219382f9cc2a2298bc9f6a5
https://doi.org/10.1080/10586458.2021.1994487

CNN-on-AWS: Efficient allocation of multikernel applications on Multi-FPGA platforms

Autor: Jordi Cortadella, Mario R. Casu, Mihai Teodor Lazarescu, Junnan Shan, Luciano Lavagno

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Multi-FPGA platforms, like Amazon AWS F1, can run in the cloud multikernel pipelined applications, like convolutional neural networks (CNNs), with excellent performance and lower energy consumption than CPUs or GPUs. We propose a method to efficientl

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb0c355b001085a23402b794ab438b2e
http://hdl.handle.net/2117/345016

Alignment of biological networks by integer linear programming: virus-host protein-protein interaction networks

Autor: Francesc Rosselló, Gabriel Valiente, Gabriel Riera, Mercè Llabrés

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
BMC Bioinformatics, Vol 21, Iss S6, Pp 1-14 (2020)
BMC Bioinformatics

Background The alignment of protein-protein interaction networks was recently formulated as an integer quadratic programming problem, along with a linearization that can be solved by integer linear programming software tools. However, the resulting i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ddf3d8cd75d73ab7bb213ccbec9cd81
https://doi.org/10.1186/s12859-020-03733-w

Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers

Autor: Albert Oliveras, Enric Rodríguez-Carbonell, Cristina Borralleras, Daniel Larraz, Albert Rubio

Publikováno v: ACM Transactions on Computational Logic
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname

We present new methods for solving the Satisfiability Modulo Theories problem over the theory of QuantifierFree Non-linear Integer Arithmetic, SMT(QF-NIA), which consists of deciding the satisfiability of ground formulas with integer polynomial const

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4c31ef2ef5df29a2cd89b035e9527ab

Proving termination through conditional termination

Autor: Marc Brockschmidt, Enric Rodríguez-Carbonell, Daniel Larraz, Albert Rubio, Cristina Borralleras, Albert Oliveras

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783662545768
TACAS (1)

We present a constraint-based method for proving conditional termination of integer programs. Building on this, we construct a framework to prove (unconditional) program termination using a powerful mechanism to combine conditional termination proofs

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a1ec6a4a90b65b239baa38fda0688d8