Result 1 to 20 of 42 total
Service-oriented volunteer computing for massively parallel constraint solving using portfolios. (English)
Lodi, Andrea (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 7th international conference, CPAIOR 2010, Bologna, Italy, June 14‒18, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13519-4/pbk). Lecture Notes in Computer Science 6140, 246-251 (2010).
1
Service-oriented volunteer computing for massively parallel constraint solving using portfolios (English)
CPAIOR, 246-251 (2010).
2
Multiset ordering constraints. (English)
Comput. Res. Repos. 2009, Article No. 0905.3769 (2009).
3
SLIDE: A useful special case of the CARDPATH constraint. (English)
Comput. Res. Repos. 2009, Article No. 0903.0471 (2009).
4
The parameterized complexity of global constraints. (English)
Comput. Res. Repos. 2009, Article No. 0903.0467 (2009).
5
Filtering algorithms for the multiset ordering constraint. (English)
Comput. Res. Repos. 2009, Article No. 0903.0460 (2009).
6
Range and roots: two common patterns for specifying and propagating counting and occurrence constraints. (English)
Comput. Res. Repos. 2009, Article No. 0903.0211 (2009).
7
Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints. (English)
Artif. Intell. 173, No. 11, 1054-1078 (2009).
8
Filtering algorithms for the multiset ordering constraint. (English)
Artif. Intell. 173, No. 2, 299-328 (2009).
9
SLIDE: A useful special case of the CARDPATH constraint (English)
ECAI, 475-479 (2008).
10
The parameterized complexity of global constraints (English)
AAAI, 235-240 (2008).
11
CP-based local branching. (English)
Bessière, Christian (ed.), Principles and practice of constraint programming ‒ CP 2007. 13th international conference, CP 2007, Providence, RI, USA, September 23‒27, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74969-1/pbk). Lecture Notes in Computer Science 4741, 847-855 (2007).
12
Reformulating global constraints: the slideand regularconstraints (English)
SARA, 80-92 (2007).
13
CP-based local branching (English)
CP, 847-855 (2007).
14
The ROOTS constraint. (English)
Benhamou, Frédéric (ed.), Principles and practice of constraint programming ‒ CP 2006. 12th international conference, CP 2006, Nantes, France, September 25‒29, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-46267-5/pbk). Lecture Notes in Computer Science 4204, 75-90 (2006).
15
Propagation algorithms for lexicographic ordering constraints. (English)
Artif. Intell. 170, No. 10, 803-834 (2006).
16
Among, common and disjoint constraints. (English)
Hnich, Brahim (ed.) et al., Recent advances in constraints. Joint ERCIM/CoLogNET international workshop on constraint solving and constraint logic programming, CSCLP 2005, Uppsala, Sweden, June 20‒22, 2005. Revised selected and invited papers. Berlin: Springer (ISBN 3-540-34215-X/pbk). Lecture Notes in Computer Science 3978. Lecture Notes in Artificial Intelligence, 29-43 (2006).
17
The range constraint: Algorithms and implementation. (English)
Beck, J. Christopher (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. Third international conference, CPAIOR 2006, Cork, Ireland, May 31 ‒ June 2, 2006. Proceedings. Berlin: Springer (ISBN 3-540-34306-7/pbk). Lecture Notes in Computer Science 3990, 59-73 (2006).
18
Filtering algorithms for the NValue constraint. (English)
Constraints 11, No. 4, 271-293 (2006).
19
The range constraint: algorithms and implementation (English)
CPAIOR, 59-73 (2006).
20
Result 1 to 20 of 42 total
Start
Contact
Print
General Help
