Clustering for disconnected solution sets of numerical CSPs

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3010, Issue , 2004, Pages 25-43

  Vu, Xuan Ha ^a   Sam Haroud, Djamila ^a   Faltings, Boi ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; LARGE SCALE SYSTEMS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS); CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT SATISFACTION PROBLEMS; LOGIC PROGRAMMING;

ADAPTIVE CLUSTERING; BOUNDING VOLUME TECHNIQUES; CONSTRAINT SATISFACTION PROBLEMS (CSP); TREE STRUCTURE; CLUSTERING TECHNIQUES; COMPLEX QUERIES; DISCONNECTED SOLUTION; NEW CLUSTERING ALGORITHMS; PRACTICAL PROBLEMS; SOLUTION SET;

SET THEORY; CLUSTERING ALGORITHMS;

EID: 9444283790     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-24662-6_2     Document Type: Conference Paper

References (29)

1. Agarwal, P., de Berg, M., Gudmundsson, J., Hammar, M., Haverkort, H.: BoxTrees and R-Trees with Near-Optimal Query Time. In: Proceedings of the 17th ACM Symposium on Computational Geometry, ACM Press (2001) 124-133
2. van den Bergen, G.: Efficient Collision Detection of Complex Deformable Models using AABB Trees. Journal of Graphics Tools 4(2) (1997) 7-25
3. Fahn, C.S., Wang, J.L.: Efficient Time-Interrupted and Time-Continuous Collision Detection Among Polyhedral Objects in Arbitrary Motion. Journal of Information Science and Engineering 15 (1999) 769-799
4. Zhou, Y., Suri, S.: Analysis of a Bounding Box Heuristic for Object Intersection. In: Proceedings of the 10th Annual Symposium on Discrete Algorithms (SODA'99). (1999)
5. Ganovelli, P., Dingliana, J., O'Sullivan, C.: BucketTree: Improving Collision Detection Between Deformable Objects. In: Spring Conference on Computer Graphics (SCCG'2000). (2000)
6. Larsson, T., Akenine-Moller, T.: Collection Detection for Continuously Deforming Bodies. In: Eurographics'2001, Manchester, UK (2001)
7. Haverkort, H., de Berg, M., Gudmundsson, J.: Box-Trees for Collision Checking in Industrial Installations. In: Proceedings of the 18th ACM Symposium on Computational Geometry, ACM Press (2002) 53-62
8. Fahn, C.S., Wang, J.L.: Adaptive Space Decomposition for Fast Visualization of Soft Object. Journal of Visualization and Computer Animation 14(1) (2003) 1-19
9. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
10. Labroche, N., Monmarche, N., Venturini, G.: A New Clustering Algorithm Based on the Chemical Recognition System of Ants. In: Proceedings of the 15th European Conference on Artificial Intelligence (ECAI'2002), France, IOS Press (2002) 345-349
11. Benhamou, F., Goualard, F.: Universally Quantified Interval Constraints. In: Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (CP'2000). (2000) 67-82
12. Kearfott, B.: Interval Computations: Introduction, Uses, and Resources, Euromath Bulletin 2(1) (1996) 95-112
13. Burkill, J.: Functions of Intervals. Proceedings of the London Mathematical Society 22 (1924) 375-446
14. Sunaga, T.: Theory of an Interval Algebra and its Applications to Numerical Analysis. RAAG Memoirs 2 (1958) 29-46
15. Moore, R.: Interval Arithmetic and Automatic Error Analysis in Digital Computing. PhD thesis, Stanford University, USA (1962)
16. Moore, R.: Interval Analysis. Prentice Hall, Englewood Cliffs, NJ (1966)
17. Hickey, T., Ju, Q., Van Emden, M.: Interval Arithmetic: from Principles to Implementation. Journal of the ACM (JACM) 48(5) (2001) 1038-1068
18. Jaulin, L., Kieffer, M., Didrit, O., Walter, E.: Applied Interval Analysis. First edn. Springer (2001) ISBN 1-85233-219-0.
19. Vu, X.H., Sam-Haroud, D., Silaghi, M.C.: Approximation techniques for nonlinear problems with continuum of solutions. In: Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation (SARA 2002). Volume 2371 of LNAL, Canada, Springer-Verlag (2002) 224-241
20. Vu, X.H., Sam-Haroud, D., Silaghi, M.C.: Numerical Constraint Satisfaction Problems with Non-isolated Solutions. In: Global Optimization and Constraint Satisfaction: First International Workshop on Global Constrained Optimization and Constraint Satisfaction (COCOS 2002), France, October 2-4, 2002, Revised Selected Papers. Volume 2861 of LNCS., Springer-Verlag (2003) 194-210
21. Silaghi, M.C., Sam-Haroud, D., Faltings, B.: Search Techniques for Non-linear CSPs with Inequalities. In: Proceedings of the 14th Canadian Conference on AI. (2001)
22. Lhomme, O.: Consistency Techniques for Numeric CSPs. In: Proceedings of IJCAI'93. (1993)
23. Van Hentenryck, P.: A Gentle Introduction to NUMERICA. Artificial Intelligence 103 (1998) 209-235
24. Collavizza, H., Delobel, F., Rueher, M.: A Note on Partial Consistencies over Continuous Domains. In: Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming (CP'98). (1998)
25. Granvilliers, L., Goualard, F., Benhamou, F.: Box Consistency through Weak Box Consistency. In: Proceedings of ICTAI'99. (1999)
26. Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.F.: Revising Hull and Box Consistency. In: Proceedings of the International Conference on Logic Programming (ICLP'99), Las Cruces, USA (1999) 230-244
27. Sam-Haroud, D., Faltings, B.: Consistency Techniques for Continuous Constraints. Constraints 1(1-2) (1996) 85-118
28. Lottaz, C.: Collaborative Design using Solution Spaces. PhD thesis, Ecole Polytechnique Fédérale de Lausanne (EPFL), Switzerland (2000)
29. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press (1993)