Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJavier Larrosa
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
[j21]William Lam, Kalev Kask, Javier Larrosa, Rina Dechter:
Subproblem ordering heuristics for AND/OR best-first search. J. Comput. Syst. Sci. 94: 41-62 (2018)- 2017
- [j20]William Lam, Kalev Kask, Javier Larrosa, Rina Dechter:
Residual-Guided Look-Ahead in AND/OR Search for Graphical Models. J. Artif. Intell. Res. 60: 287-346 (2017) - 2016
- [c44]Rina Dechter, Kalev Kask, William Lam, Javier Larrosa:
Look-Ahead with Mini-Bucket Heuristics for MPE. AAAI 2016: 694-701 - [c43]William Lam, Kalev Kask, Rina Dechter, Javier Larrosa:
On the Impact of Subproblem Orderings on Anytime AND/OR Best-First Search for Lower Bounds. ECAI 2016: 1567-1568 - [c42]Javier Larrosa, Emma Rollon, Rina Dechter:
Limited Discrepancy AND/OR Search and Its Application to Optimization Tasks in Graphical Models. IJCAI 2016: 617-623 - 2014
- [c41]Emma Rollon, Javier Larrosa:
Decomposing Utility Functions in Bounded Max-Sum for Distributed Constraint Optimization. CP 2014: 646-654 - 2013
- [c40]Emma Rollon, Javier Larrosa, Rina Dechter:
Semiring-Based Mini-Bucket Partitioning Schemes. IJCAI 2013: 644-650 - [c39]Javier Larrosa, Emma Rollon:
Risk-neutral bounded max-sum for distributed constraint optimization. SAC 2013: 92-97 - 2012
- [j19]Stefano Bistarelli, Fabio Gadducci, Javier Larrosa, Emma Rollon, Francesco Santini:
Local arc consistency for non-invertible semirings, with an application to multi-objective optimization. Expert Syst. Appl. 39(2): 1708-1717 (2012) - [c38]Emma Rollon, Javier Larrosa:
Improved Bounded Max-Sum for Distributed Constraint Optimization. CP 2012: 624-632 - 2011
- [j18]Javier Larrosa, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell:
A Framework for Certified Boolean Branch-and-Bound Optimization. J. Autom. Reasoning 46(1): 81-102 (2011) - [c37]Emma Rollon, Javier Larrosa:
On Mini-Buckets and the Min-fill Elimination Ordering. CP 2011: 759-773 - [e1]Javier Larrosa, Barry O'Sullivan:
Recent Advances in Constraints - 14th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2009, Barcelona, Spain, June 15-17, 2009, Revised Selected Papers. Lecture Notes in Computer Science 6384, Springer 2011, ISBN 978-3-642-19485-6 [contents] - [i2]Javier Larrosa, Enric Morancho, David Niso:
On the Practical use of Variable Elimination in Constraint Optimization Problems: 'Still-life' as a Case Study. CoRR abs/1109.2131 (2011) - 2010
- [c36]Javier Larrosa, Albert Oliveras, Enric Rodríguez-Carbonell:
Semiring-Induced Propositional Logic: Definition and Basic Algorithms. LPAR (Dakar) 2010: 332-347 - [c35]Stefano Bistarelli, Fabio Gadducci, Javier Larrosa, Emma Rollon, Francesco Santini:
Extending Soft Arc Consistency Algorithms to Non-invertible Semirings. MICAI (1) 2010: 386-398
2000 – 2009
- 2009
- [c34]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
- [j17]Javier Larrosa, Federico Heras, Simon de Givry:
A logical approach to efficient Max-SAT solving. Artif. Intell. 172(2-3): 204-233 (2008) - [j16]Federico Heras, Javier Larrosa, Albert Oliveras:
MiniMaxSAT: An Efficient Weighted Max-SAT solver. J. Artif. Intell. Res. 31: 1-32 (2008) - [j15]Federico Heras, Javier Larrosa, Simon de Givry, Thomas Schiex:
2006 and 2007 Max-SAT Evaluations: Contributed Instances. JSAT 4(2-4): 239-250 (2008) - [c33]Stefano Bistarelli, Fabio Gadducci, Javier Larrosa, Emma Rollon:
A Soft Approach to Multi-objective Optimization. ICLP 2008: 764-768 - [c32]Federico Heras, Javier Larrosa:
A Max-SAT Inference-Based Pre-processing for Max-Clique. SAT 2008: 139-152 - 2007
- [c31]
- [c30]Federico Heras, Javier Larrosa, Albert Oliveras:
MiniMaxSat: A New Weighted Max-SAT Solver. SAT 2007: 41-55 - 2006
- [j14]Federico Heras, Javier Larrosa:
Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP. J. Heuristics 12(4-5): 287-306 (2006) - [j13]Emma Rollon, Javier Larrosa:
Bucket elimination for multiobjective optimization problems. J. Heuristics 12(4-5): 307-328 (2006) - [c29]
- [c28]
- [c27]Emma Rollon, Javier Larrosa:
Multi-Objective Propagation in Constraint Programming. ECAI 2006: 128-132 - [i1]Javier Larrosa, Federico Heras, Simon de Givry:
A Logical Approach to Efficient Max-SAT solving. CoRR abs/cs/0611025 (2006) - 2005
- [j12]Kalev Kask, Rina Dechter, Javier Larrosa, Avi Dechter:
Unifying tree decompositions for reasoning in graphical models. Artif. Intell. 166(1-2): 165-193 (2005) - [j11]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. 23: 421-440 (2005) - [c26]
- [c25]Martí Sánchez-Fibla, Javier Larrosa, Pedro Meseguer:
Tree Decomposition with Function Filtering. CP 2005: 593-606 - [c24]Federico Heras, Javier Larrosa:
Local Consistency in Weighted CSPs and Inference in Max-SAT. CP 2005: 849 - [c23]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 - [c22]Javier Larrosa, Federico Heras:
Resolution in Max-SAT and its relation to local consistency in weighted CSPs. IJCAI 2005: 193-198 - [c21]Martí Sánchez-Fibla, Javier Larrosa, Pedro Meseguer:
Improving Tree Decomposition Methods With Function Filtering. IJCAI 2005: 1537-1538 - 2004
- [j10]Javier Larrosa, Thomas Schiex:
Solving weighted CSP by maintaining arc consistency. Artif. Intell. 159(1-2): 1-26 (2004) - [c20]Martí Sánchez-Fibla, Pedro Meseguer, Javier Larrosa:
Improving the Applicability of Adaptive Consistency: Preliminary Results. CP 2004: 757-761 - [c19]Martí Sánchez-Fibla, Pedro Meseguer, Javier Larrosa:
Using Constraints with Memory to Implement Variable Elimination. ECAI 2004: 216-220 - 2003
- [j9]Javier Larrosa, Pedro Meseguer:
Algoritmos para Satisfacción de Restricciones. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 7(20): 31-42 (2003) - [j8]Javier Larrosa, Pedro Meseguer:
Restricciones Blanda: Modelos y Algoritmos. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 7(20): 69-82 (2003) - [j7]Javier Larrosa, Rina Dechter:
Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. Constraints 8(3): 303-326 (2003) - [c18]Simon de Givry, Javier Larrosa, Pedro Meseguer, Thomas Schiex:
Solving Max-SAT as Weighted CSP. CP 2003: 363-376 - [c17]Javier Larrosa, Enric Morancho:
Solving 'Still Life' with Soft Constraints and Bucket Elimination. CP 2003: 466-479 - [c16]Javier Larrosa, Thomas Schiex:
In the quest of the best form of local consistency for Weighted CSP. IJCAI 2003: 239-244 - 2002
- [j6]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) - [j5]Javier Larrosa, Pedro Meseguer:
Partition-Based Lower Bound for Max-CSP. Constraints 7(3-4): 407-419 (2002) - [j4]Javier Larrosa, Gabriel Valiente:
Constraint Satisfaction Algorithms for Graph Pattern Matching. Mathematical Structures in Computer Science 12(4): 403-422 (2002) - [c15]
- [c14]Javier Larrosa, Pedro Meseguer, Martí Sánchez-Fibla:
Pseudo-tree Search with Soft Constraints. ECAI 2002: 131-135 - 2001
- [c13]Pedro Meseguer, Javier Larrosa, Martí Sánchez-Fibla:
Lower Bounds for Non-binary Constraint Optimization Problems. CP 2001: 317-331 - [c12]Rina Dechter, Kalev Kask, Javier Larrosa:
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization. CP 2001: 346-360 - 2000
- [c11]
1990 – 1999
- 1999
- [j3]Javier Larrosa, Pedro Meseguer, Thomas Schiex:
Maintaining Reversible DAC for Max-CSP. Artif. Intell. 107(1): 149-163 (1999) - [c10]Christian Bessière, Pedro Meseguer, Eugene C. Freuder, Javier Larrosa:
On Forward Checking for Non-binary Constraint Satisfaction. CP 1999: 88-102 - [c9]
- 1998
- [c8]Javier Larrosa, Pedro Meseguer, Thomas Schiex, Gérard Verfaillie:
Reversible DAC and Other Improvements for Solving Max-CSP. AAAI/IAAI 1998: 347-352 - [c7]
- [c6]Javier Larrosa, Pedro Meseguer:
Generic CSP Techniques for the Job-Shop Problem. IEA/AIE (Vol. 2) 1998: 46-55 - 1997
- [c5]Javier Larrosa:
Merging Constraint Satisfaction Subproblems to Avoid Redundant Search. IJCAI (1) 1997: 424-433 - 1996
- [c4]
- [c3]
- 1995
- [j2]Javier Larrosa, Ulises Cortés:
A Framework for Abductive Rule Formation. AI Commun. 8(2): 91-100 (1995) - [j1]Gustavo Núñez, Ulises Cortés, Javier Larrosa:
Non-monotonic characterization of induction and its application to inductive learning. Int. J. Intell. Syst. 10(10): 895-927 (1995) - [c2]Javier Larrosa, Pedro Meseguer:
Optimization-based Heuristics for Maximal Constraint Satisfaction. CP 1995: 103-120 - [c1]Pedro Meseguer, Javier Larrosa:
Constraint Satisfaction as Global Optimization. IJCAI (1) 1995: 579-585
Coauthor Index
maintained by 
, founded at 
, founded at 
last updated on 2019-01-22 23:31 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
