713 citations
- M. Pimenta3 profiles24 · h 58
- D. Jeans3 profiles22 · h 40
- A. Andreazza4 profiles21 · h 101
- A. Augustinus3 profiles21 · h 89
- A. Ballestrero2 profiles21 · h 36
- A. Baroncelli4 profiles21 · h 108
- A. Behrmann3 profiles21 · h 23
- A. Ferrer3 profiles21 · h 71
- A. Hallgren5 profiles21 · h 89
- A. Lipniacka2 profiles21 · h 86
- A. Malek3 profiles21 · h 26
- A. Onofre2 profiles21 · h 88
- Centre National de la Recherche ScientifiqueFR23 papers
- European Organization for Nuclear ResearchCH22 papers
- Institute of High Energy PhysicsCN22 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR22 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di MilanoIT22 papers
- University of BolognaIT22 papers
- University of OxfordGB22 papers
- Charles UniversityCZ21 papers
- Institute of Nuclear and Particle PhysicsGR21 papers
- Iowa State UniversityUS21 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di PadovaIT21 papers
- Joint Institute for Nuclear ResearchRU21 papers
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2009★ 1 cited
On Improving Local Search for Unsatisfiability
David Pereira, Inês Lynce, Steven Prestwich
Stochastic local search (SLS) has been an active field of research in the last few years, with new techniques and procedures being developed at an astonishing rate. SLS has been tr…
cs.AI2009★ 11 cited
Algorithms for Weighted Boolean Optimization
Vasco Manquinho, Joao Marques-Silva, Jordi Planes
The Pseudo-Boolean Optimization (PBO) and Maximum Satisfiability (MaxSAT) problems are natural optimization extensions of Boolean Satisfiability (SAT). In the recent past, differen…
cs.AI2008
Symmetry Breaking for Maximum Satisfiability
Joao Marques-Silva, Ines Lynce, Vasco Manquinho
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred…