Mostrando resultados 17 a 36 de 50
< Anterior
Siguiente >
| Derechos | Preview | Fecha Public. | Título | Autor(es) | Tipo |
| closedAccess |  | 1-ene-2022 | Boosting branch-and-bound MaxSAT solvers with clause learning | Li, Chu Min; Xu, Zhenxing; Coll, Jordi; Manyà, Felip CSIC ORCID ; Habet, Djamal; He, Kun | artículo |
| openAccess | | 22-may-2019 | Clausal Form Transformation in MaxSAT | Min Li, Chu; Manyà, Felip CSIC ORCID ; Soler, Joan Ramon CSIC | comunicación de congreso |
| openAccess |  | 2022 | Clausal Forms in MaxSAT and MinSAT | Li, C M.; Manyà, Felip CSIC ORCID ; Joan Ramon Soler; Amanda Vidal | artículo |
| closedAccess |  | 2018 | Clause Branching in MaxSAT and MinSAT | Argelich, Josep; Li, Chu Min; Manyà, Felip CSIC ORCID ; Zhu, Zhu | comunicación de congreso |
| closedAccess |  | 2021 | Clause tableaux for maximum and minimum satisfiability | Argelich, Josep; Li, C.M.; Manyà, Felip CSIC ORCID ; Soler, Joan Ramon CSIC | artículo |
| openAccess |  | 2020 | Clause vivification by unit propagation in CDCL SAT solvers | Li, C.M.; Xiao, F.; Luo, Mao; Manyà, Felip CSIC ORCID ; Lü, Z.; Li, Y. | artículo |
| openAccess |  | 1-oct-2021 | Combining clause learning and branch and bound for MaxSAT | Li, Chu Min; Xu, Zhenxing; Coll, Jordi; Manyà, Felip CSIC ORCID ; Habet, Djamal; He, Kun | capítulo de libro |
| openAccess | | 29-ago-2016 | Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs | Jiang, Hua; Li, Chu Min; Manyà, Felip CSIC ORCID | artículo |
| closedAccess |  | 2012 | Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT | Argelich, Josep; Cabiscol, Alba; Lynce, Ines; Manyà, Felip CSIC ORCID | artículo |
| closedAccess |  | 22-may-2017 | Exploiting Many-Valued Variables in MaxSAT | Argelich, Josep; Li, Chumin; Manyà, Felip CSIC ORCID | artículo |
| closedAccess |  | 2007 | Exploiting multivalued knowledge in variable selection heuristics for SAT solvers | Ansotegui, Carlos; Larrubia, Jose; Li, Chumin; Manyà, Felip CSIC ORCID | artículo |
| openAccess | | 18-may-2015 | Finding Hard Instances of Satisfiability in Lukasiewicz Logics | Bofill, Miquel; Manyà, Felip CSIC ORCID ; Vidal, Amanda; Villaret, Mateu | comunicación de congreso |
| openAccess |  | 2022 | Incomplete MaxSAT approaches for combinatorial testing | Carlos Ansótegui; Manyà, Felip CSIC ORCID ; Josep M. Salvia; Eduard Torres | artículo |
| closedAccess |  | 19-may-2014 | Many-Valued MinSAT Solving | Argelich, Josep; Min Li, Chu; Manyà, Felip CSIC ORCID ; Zhu Zhu | comunicación de congreso |
| closedAccess |  | 16-sep-2013 | MinSAT versus MaxSAT for Optimization Problems | Argelich, Josep; Li, Chu Min; Manyà, Felip CSIC ORCID ; Zhu, Zhu | capítulo de libro |
| closedAccess |  | 2014 | Modeling energy consumption in automated vacuum waste collection systems | Fernández, César; Manyà, Felip CSIC ORCID ; Mateu, Carles; Sole-Mauri, Francina | artículo |
| openAccess |  | ago-2022 | Negative Learning Ant Colony Optimization for MaxSAT | Teddy Nurcahyadi; Blum, Christian CSIC ORCID ; Manyà, Felip CSIC ORCID | artículo |
| openAccess |  | abr-2019 | New complexity results for Lukasiewicz logic | Bofill, Miquel; Manyà, Felip CSIC ORCID ; Vidal, Amanda; Villaret, Mateu | artículo |
| closedAccess |  | 2007 | New inference rules for max-SAT | Li, Chumin; Manyà, Felip CSIC ORCID ; Planes, Jordi | artículo |
| closedAccess |  | 2017 | On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem | Li, Chumin; Jiang, Hua; Manyà, Felip CSIC ORCID | artículo |
