default search action
BibTeX records: Christian Bliek
@proceedings{DBLP:conf/cocos/2002, editor = {Christian Bliek and Christophe Jermann and Arnold Neumaier}, title = {Global Optimization and Constraint Satisfaction, First International Workshop Global Constraint Optimization and Constraint Satisfaction, {COCOS} 2002, Valbonne-Sophia Antipolis, France, October 2-4, 2002, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {2861}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/b94062}, doi = {10.1007/B94062}, isbn = {3-540-20463-6}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cocos/2002.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ijcai/BliekS99, author = {Christian Bliek and Djamila Sam{-}Haroud}, editor = {Thomas Dean}, title = {Path Consistency on Triangulated Constraint Graphs}, booktitle = {Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, {IJCAI} 99, Stockholm, Sweden, July 31 - August 6, 1999. 2 Volumes, 1450 pages}, pages = {456--461}, publisher = {Morgan Kaufmann}, year = {1999}, url = {http://ijcai.org/Proceedings/99-1/Papers/066.pdf}, timestamp = {Tue, 20 Aug 2019 16:18:16 +0200}, biburl = {https://dblp.org/rec/conf/ijcai/BliekS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aaai/Bliek98, author = {Christian Bliek}, editor = {Jack Mostow and Chuck Rich}, title = {Generalizing Partial Order and Dynamic Backtracking}, booktitle = {Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, {AAAI} 98, {IAAI} 98, July 26-30, 1998, Madison, Wisconsin, {USA}}, pages = {319--325}, publisher = {{AAAI} Press / The {MIT} Press}, year = {1998}, url = {http://www.aaai.org/Library/AAAI/1998/aaai98-045.php}, timestamp = {Tue, 05 Sep 2023 09:10:47 +0200}, biburl = {https://dblp.org/rec/conf/aaai/Bliek98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cp/BliekNT98, author = {Christian Bliek and Bertrand Neveu and Gilles Trombettoni}, editor = {Michael J. Maher and Jean{-}Francois Puget}, title = {Using Graph Decomposition for Solving Continuous CSPs}, booktitle = {Principles and Practice of Constraint Programming - CP98, 4th International Conference, Pisa, Italy, October 26-30, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1520}, pages = {102--116}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/3-540-49481-2\_9}, doi = {10.1007/3-540-49481-2\_9}, timestamp = {Tue, 14 May 2019 10:00:45 +0200}, biburl = {https://dblp.org/rec/conf/cp/BliekNT98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ecai/WeigelB98, author = {Rainer Weigel and Christian Bliek}, editor = {Henri Prade}, title = {On Reformulation of Constraint Satisfaction Problems}, booktitle = {13th European Conference on Artificial Intelligence, Brighton, UK, August 23-28 1998, Proceedings.}, pages = {254--258}, publisher = {John Wiley and Sons}, year = {1998}, timestamp = {Wed, 31 Jul 2019 08:45:03 +0200}, biburl = {https://dblp.org/rec/conf/ecai/WeigelB98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rc/Bliek97, author = {Christian Bliek}, title = {Fast Evaluation of Partial Derivatives and Interval Slopes}, journal = {Reliab. Comput.}, volume = {3}, number = {3}, pages = {259--268}, year = {1997}, url = {https://doi.org/10.1023/A:1009970723383}, doi = {10.1023/A:1009970723383}, timestamp = {Thu, 16 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rc/Bliek97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.