2009 |
12 | EE | Magnus Ågren,
Pierre Flener,
Justin Pearson:
Revisiting constraint-directed search.
Inf. Comput. 207(3): 438-457 (2009) |
2007 |
11 | EE | Magnus Ågren,
Pierre Flener,
Justin Pearson:
Generic Incremental Algorithms for Local Search.
Constraints 12(3): 293-324 (2007) |
2006 |
10 | EE | Magnus Ågren,
Pierre Flener,
Justin Pearson:
Inferring Variable Conflicts for Local Search.
CP 2006: 665-669 |
2005 |
9 | EE | Magnus Ågren,
Pierre Flener,
Justin Pearson:
Incremental Algorithms for Local Search from Existential Second-Order Logic.
CP 2005: 47-61 |
8 | EE | Magnus Ågren,
Pierre Flener,
Justin Pearson:
Set Variables and Local Search.
CPAIOR 2005: 19-33 |
7 | EE | Pascal Van Hentenryck,
Pierre Flener,
Justin Pearson,
Magnus Ågren:
Compositional Derivation of Symmetries for Constraint Satisfaction.
SARA 2005: 234-247 |
2004 |
6 | EE | Magnus Ågren:
Set Variables and Local Search.
CP 2004: 788 |
2003 |
5 | EE | Pierre Flener,
Justin Pearson,
Magnus Ågren:
Introducing ESRA, a Relational Language for Modelling Combinatorial Problems.
CP 2003: 971 |
4 | | Pascal Van Hentenryck,
Pierre Flener,
Justin Pearson,
Magnus Ågren:
Tractable Symmetry Breaking for CSPs with Interchangeable Values.
IJCAI 2003: 277-284 |
3 | EE | Pierre Flener,
Justin Pearson,
Magnus Ågren:
Introducing esra, a Relational Language for Modelling Combinatorial Problems.
LOPSTR 2003: 214-232 |
2002 |
2 | EE | Magnus Ågren,
Tamás Szeredi,
Nicolas Beldiceanu,
Mats Carlsson:
Tracing and Explaining Execution of CLP(FD) Programs.
WLPE 2002: 1-16 |
1 | EE | Magnus Ågren,
Tamás Szeredi,
Nicolas Beldiceanu,
Mats Carlsson:
Tracing and Explaining Execution of CLP(FD) Programs
CoRR cs.SE/0207047: (2002) |