Result 1 to 16 of 16 total
\LaTeX and friends. With foreword by Joseph Wright. (English)
X.media.publishing. Berlin: Springer (ISBN 978-3-642-23815-4/hbk; 978-3-642-23816-1/ebook). xxv, 299~p. EUR~49.95/net; SFR~66.50; \sterling~44.99; \$~69.95 (2012).
1
Promoting robust black-box solvers through competitions. (English)
Constraints 15, No. 3, 317-326 (2010).
2
Probabilistic consistency boosts MAC and SAC (English)
IJCAI, 143-148 (2007).
3
Beyond singleton arc consistency (English)
ECAI, 163-167 (2006).
4
Probabilistic arc consistency. (English)
van Beek, Peter (ed.), Principles and practice of constraint programming ‒ CP 2005. 11th international conference, CP 2005, Sitges, Spain, October 1‒5, 2005. Proceedings. Berlin: Springer (ISBN 978-3-540-29238-8/pbk). Lecture Notes in Computer Science 3709, 862 (2005).
5
Reducing checks and revisions in coarse-grained MAC algorithms (English)
IJCAI, 236-241 (2005).
6
Probabilistic arc consistency (English)
CP, 862 (2005).
7
Computing the frequency of partial orders. (English)
Wallace, Mark (ed.), Principles and practice of constraint programming ‒ CP 2004. 10th international conference, CP 2004, Toronto, Canada, September 27‒October 1, 2004. Proceedings. Berlin: Springer (ISBN 978-3-540-23241-4/pbk). Lecture Notes in Computer Science 3258, 772-776 (2004).
8
Saving support-checks does not always save time. (English)
Artif. Intell. Rev. 21, No. 3-4, 317-334 (2004).
9
Computing the frequency of partial orders (English)
CP, 772-776 (2004).
10
Domain-heuristics for arc-consistency algorithms. (English)
O’Sullivan, Barry (ed.), Recent advances in constraints. Joint ERCIM/CologNet international workshop on constraint solving and constraint logic programming, Cork, Ireland, June 19-21, 2002. Selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 2627, 62-75 (2003).
11
AC-$3_{d}$ an efficient arc-consistency algorithm with a low space-complexity. (English)
Van Hentenryck, Pascal (ed.), Principles and practice of constraint programming ‒ CP 2002. 8th international conference, CP 2002, Ithaca, NY, USA, September 9‒13, 2002. Proceedings. Berlin: Springer (ISBN 3-540-44120-4/pbk). Lecture Notes in Computer Science 2470, 755-760 (2002).
12
Domain-heuristics for arc-consistency algorithms (English)
International Workshop on Constraint Solving and Constraint Logic Programming, 62-75 (2002).
13
$AC-3_{d}$ an efficient arc-consistency algorithm with a low space-complexity (English)
CP, 755-760 (2002).
14
A theoretical analysis of the average-time complexity of domain-heuristics for arc-consistency algorithms (English)
JFPLC, 27-42 (2001).
15
Polynomial ideals, Gröbner bases and constraints. (English)
Electron. Notes Theor. Comput. Sci. 40 (2000).
16
Result 1 to 16 of 16 total