Mostrando resultados 25 a 44 de 50
< Anterior
Siguiente >
| Derechos | Preview | Fecha Public. | Título | Autor(es) | Tipo |
| 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 |
| closedAccess |  | 2012 | Optimizing with minimum satisfiability | Li, Chumin; Zhu, Zhu; Manyà, Felip CSIC ORCID ; Simon, Laurent | artículo |
| closedAccess |  | 2011 | Preface: Artificial intelligence research and development | Fernández, César; Geffner, Hector; Manyà, Felip CSIC ORCID | artículo |
| closedAccess |  | 2007 | Regular-SAT: A many-valued approach to solving combinatorial problems | Bejar, Ramon; Manyà, Felip CSIC ORCID ; Cabiscol, Alba; Fernández, César; Gomes, Carla | artículo |
| closedAccess |  | 2007 | Resolution for Max-SAT | Bonet, María Luisa; Levy, Jordi CSIC ORCID ; Manyà, Felip CSIC ORCID | artículo |
| closedAccess |  | 2013 | Resolution procedures for multiple-valued optimization | Ansotegui, Carlos; Bonet, María Luisa; Levy, Jordi CSIC ORCID ; Manyà, Felip CSIC ORCID | artículo |
| closedAccess |  | 2010 | Resolution-based lower bounds in MaxSAT | Li, Chumin; Manyà, Felip CSIC ORCID ; Mohamedou, Nouredine O.; Planes, Jordi | artículo |
| closedAccess |  | 2015 | SAT and SMT technology for many-valued logics | Ansotegui, Carlos; Bofill, Miquel; Manyà, Felip CSIC ORCID ; Villaret, Mateu | artículo |
| closedAccess |  | 2021 | Solving longest common subsequence problems via a transformation to the maximum clique problem | Blum, Christian CSIC ORCID ; Djukanovic, Marco; Santini, Alberto; Jiang, Hua; Li, Chu-Min; Manyà, Felip CSIC ORCID ; Raidl, G.R. | artículo |
