 | 2009 |
|---|
| 51 |       | Javier Larrosa,
Robert Nieuwenhuis,
Albert Oliveras,
Enric Rodríguez-Carbonell:
Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates.
SAT 2009: 453-466 |
| 2008 |
|---|
| 50 | | Stefano Bistarelli,
Fabio Gadducci,
Javier Larrosa,
Emma Rollon:
A Soft Approach to Multi-objective Optimization.
ICLP 2008: 764-768 |
| 49 | | Federico Heras,
Javier Larrosa:
A Max-SAT Inference-Based Pre-processing for Max-Clique.
SAT 2008: 139-152 |
| 48 | | Javier Larrosa,
Federico Heras,
Simon de Givry:
A logical approach to efficient Max-SAT solving.
Artif. Intell. 172(2-3): 204-233 (2008) |
| 47 | | Federico Heras,
Javier Larrosa,
Albert Oliveras:
MiniMaxSAT: An Efficient Weighted Max-SAT solver.
J. Artif. Intell. Res. (JAIR) 31: 1-32 (2008) |
| 46 | | Federico Heras,
Javier Larrosa,
Simon de Givry,
Thomas Schiex:
2006 and 2007 Max-SAT Evaluations: Contributed Instances.
JSAT 4(2-4): 239-250 (2008) |
| 2007 |
|---|
| 45 |  | Emma Rollon,
Javier Larrosa:
Multi-Objective Russian Doll Search.
AAAI 2007: 249-254 |
| 44 | | Federico Heras,
Javier Larrosa,
Albert Oliveras:
MiniMaxSat: A New Weighted Max-SAT Solver.
SAT 2007: 41-55 |
| 2006 |
|---|
| 43 | | Federico Heras,
Javier Larrosa:
New Inference Rules for Efficient Max-SAT Solving.
AAAI 2006 |
| 42 | | Emma Rollon,
Javier Larrosa:
Mini-bucket Elimination with Bucket Propagation.
CP 2006: 484-498 |
| 41 | | Emma Rollon,
Javier Larrosa:
Multi-Objective Propagation in Constraint Programming.
ECAI 2006: 128-132 |
| 40 | | Javier Larrosa,
Federico Heras,
Simon de Givry:
A Logical Approach to Efficient Max-SAT solving
CoRR abs/cs/0611025: (2006) |
| 39 | | Federico Heras,
Javier Larrosa:
Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP.
J. Heuristics 12(4-5): 287-306 (2006) |
| 38 | | Emma Rollon,
Javier Larrosa:
Bucket elimination for multiobjective optimization problems.
J. Heuristics 12(4-5): 307-328 (2006) |
| 2005 |
|---|
| 37 | | Emma Rollon,
Javier Larrosa:
Depth-First Mini-Bucket Elimination.
CP 2005: 563-577 |
| 36 | | Martí Sánchez,
Javier Larrosa,
Pedro Meseguer:
Tree Decomposition with Function Filtering.
CP 2005: 593-606 |
| 35 | | Federico Heras,
Javier Larrosa:
Local Consistency in Weighted CSPs and Inference in Max-SAT.
CP 2005: 849 |
| 34 | | Martí Sánchez,
Javier Larrosa,
Pedro Meseguer:
Improving Tree Decomposition Methods With Function Filtering.
IJCAI 2005: 1537-1538 |
| 33 | | Javier Larrosa,
Federico Heras:
Resolution in Max-SAT and its relation to local consistency in weighted CSPs.
IJCAI 2005: 193-198 |
| 32 | | Simon de Givry,
Federico Heras,
Matthias Zytnicki,
Javier Larrosa:
Existential arc consistency: Getting closer to full arc consistency in weighted CSPs.
IJCAI 2005: 84-89 |
| 31 | | Kalev Kask,
Rina Dechter,
Javier Larrosa,
Avi Dechter:
Unifying tree decompositions for reasoning in graphical models.
Artif. Intell. 166(1-2): 165-193 (2005) |
| 30 | | Javier Larrosa,
Enric Morancho,
David Niso:
On the Practical use of Variable Elimination in Constraint Optimization Problems: 'Still-life' as a Case Study.
J. Artif. Intell. Res. (JAIR) 23: 421-440 (2005) |
| 2004 |
|---|
| 29 | | Martí Sánchez,
Pedro Meseguer,
Javier Larrosa:
Improving the Applicability of Adaptive Consistency: Preliminary Results.
CP 2004: 757-761 |
| 28 | | Martí Sánchez,
Pedro Meseguer,
Javier Larrosa:
Using Constraints with Memory to Implement Variable Elimination.
ECAI 2004: 216-220 |
| 27 | | Javier Larrosa,
Thomas Schiex:
Solving weighted CSP by maintaining arc consistency.
Artif. Intell. 159(1-2): 1-26 (2004) |
| 2003 |
|---|
| 26 | | Simon de Givry,
Javier Larrosa,
Pedro Meseguer,
Thomas Schiex:
Solving Max-SAT as Weighted CSP.
CP 2003: 363-376 |
| 25 | | Javier Larrosa,
Enric Morancho:
Solving 'Still Life' with Soft Constraints and Bucket Elimination.
CP 2003: 466-479 |
| 24 | | Javier Larrosa,
Thomas Schiex:
In the quest of the best form of local consistency for Weighted CSP.
IJCAI 2003: 239-244 |
| 23 | | Javier Larrosa,
Rina Dechter:
Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems.
Constraints 8(3): 303-326 (2003) |
| 22 | | Javier Larrosa,
Pedro Meseguer:
Algoritmos para Satisfacción de Restricciones.
Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 20: 31-42 (2003) |
| 21 | | Javier Larrosa,
Pedro Meseguer:
Restricciones Blanda: Modelos y Algoritmos.
Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 20: 69-82 (2003) |
| 2002 |
|---|
| 20 | | Javier Larrosa:
Node and Arc Consistency in Weighted CSP.
AAAI/IAAI 2002: 48-53 |
| 19 | | Javier Larrosa,
Pedro Meseguer,
Martí Sánchez:
Pseudo-tree Search with Soft Constraints.
ECAI 2002: 131-135 |
| 18 | | Christian Bessière,
Pedro Meseguer,
Eugene C. Freuder,
Javier Larrosa:
On forward checking for non-binary constraint satisfaction.
Artif. Intell. 141(1/2): 205-224 (2002) |
| 17 | | Javier Larrosa,
Pedro Meseguer:
Partition-Based Lower Bound for Max-CSP.
Constraints 7(3-4): 407-419 (2002) |
| 16 | | Javier Larrosa,
Gabriel Valiente:
Constraint Satisfaction Algorithms for Graph Pattern Matching.
Mathematical Structures in Computer Science 12(4): 403-422 (2002) |
| 2001 |
|---|
| 15 | | Pedro Meseguer,
Javier Larrosa,
Martí Sánchez:
Lower Bounds for Non-binary Constraint Optimization Problems.
CP 2001: 317-331 |
| 14 | | Rina Dechter,
Kalev Kask,
Javier Larrosa:
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization.
CP 2001: 346-360 |
| 2000 |
|---|
| 13 | | Javier Larrosa:
Boosting Search with Variable Elimination.
CP 2000: 291-305 |
| 1999 |
|---|
| 12 | | Javier Larrosa,
Pedro Meseguer:
Partition-Based Lower Bound for Max-CSP.
CP 1999: 303-315 |
| 11 | | Christian Bessière,
Pedro Meseguer,
Eugene C. Freuder,
Javier Larrosa:
On Forward Checking for Non-binary Constraint Satisfaction.
CP 1999: 88-102 |
| 10 | | Javier Larrosa,
Pedro Meseguer,
Thomas Schiex:
Maintaining Reversible DAC for Max-CSP.
Artif. Intell. 107(1): 149-163 (1999) |
| 1998 |
|---|
| 9 | | Javier Larrosa,
Pedro Meseguer,
Thomas Schiex,
Gérard Verfaillie:
Reversible DAC and Other Improvements for Solving Max-CSP.
AAAI/IAAI 1998: 347-352 |
| 8 | | Javier Larrosa,
Pedro Meseguer:
Partial Lazy Forward Checking for MAX-CSP.
ECAI 1998: 229-233 |
| 7 | | Javier Larrosa,
Pedro Meseguer:
Generic CSP Techniques for the Job-Shop Problem.
IEA/AIE (Vol. 2) 1998: 46-55 |
| 1997 |
|---|
| 6 | | Javier Larrosa:
Merging Constraint Satisfaction Subproblems to Avoid Redundant Search.
IJCAI (1) 1997: 424-433 |
| 1996 |
|---|
| 5 | | Javier Larrosa,
Pedro Meseguer:
Exploiting the Use of DAC in MAX-CSP.
CP 1996: 308-322 |
| 4 | | Javier Larrosa,
Pedro Meseguer:
Phase Transition in MAX-CSP.
ECAI 1996: 190-194 |
| 1995 |
|---|
| 3 | | Javier Larrosa,
Pedro Meseguer:
Optimization-based Heuristics for Maximal Constraint Satisfaction.
CP 1995: 103-120 |
| 2 | | Pedro Meseguer,
Javier Larrosa:
Constraint Satisfaction as Global Optimization.
IJCAI (1) 1995: 579-585 |
| 1 | | Javier Larrosa,
Ulises Cortés:
A Framework for Abductive Rule Formation.
AI Commun. 8(2): 91-100 (1995) |
