The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Javier Larrosa: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  46. A Soft Approach to Multi-objective Optimization. [Citation Graph (, )][DBLP]


  47. Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates. [Citation Graph (, )][DBLP]


  48. A Max-SAT Inference-Based Pre-processing for Max-Clique. [Citation Graph (, )][DBLP]


  49. A logical approach to efficient Max-SAT solving. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002