An adjustment model in a geometric constraint solving problem

Proceedings of the ACM Symposium on Applied Computing

Volumn 2, Issue , 2006, Pages 968-973

  Pavón, Reyes ^a   Díaz, Fernando ^b   Luzón, M Victoria ^a  

^a UNIVERSITY OF VIGO   (Spain)

^b UNIVERSITY OF VALLADOLID   (Spain)

Author keywords

Bayesian networks; Constructive geometric constraint solving; Genetic algorithms; Setting parameters

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA STRUCTURES; GENETIC ALGORITHMS; METADATA; PROBLEM SOLVING;

BAYESIAN NETWORKS; CONSTRUCTIVE GEOMETRIC CONSTRAINT SOLVING; SETTING PARAMETERS;

CONSTRAINT THEORY;

EID: 33751066168     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1141277.1141508     Document Type: Conference Paper

References (18)

1. A. Aamodt and E. Plaza, Case-based reasoning: Foundational issues, methodological variations and system approaches.: AI Communications, 7(1):39-59, 1994.
2. J. Baker. Reducing bias and inefficiency in the selection algorithm. Proceedings of the 2nd International Conference on Genetic Algorithm (ICGA '87), pages 14-21, 1987.
3. E. Barreiro, R. Joan-Arinyo, and M. Luzn. Algoritmos genticos en el problema de la solucin deseada. optimizacin de parmetros. Technical Report LSI-04-43-R, Dept. de Lenguajes y Sistemas Informticos. Univ. Politcnica de Catalua, Junio 2004.
4. T. Bock, D. Fogel, and Z. Michalewicz. Handbook of Evolutionary Computation. Institute of Physics Publishing and Oxford University Press, 1997.
5. J. Binder, D. Koller, S. Russel, and K. Kanazawa. Adaptive probabilistic networks with hidden variables. Machine Learning, 29:213-244, 1997.
6. W. Buntine. Operations for learning with graphical models. Journal of Artificial Intelligence Research, 2:159-225, 1994.
7. G. Cooper and E. Herskovits. A bayesian method for the induction of probabilistic networks from data. Machine Learning, 9:309-347, 1992.
8. C. Essert-Villard, P. Schreck, and J. Dufourd. Sketch-based pruning of a solution space within a formal geometric constraint solver. Artificial Intelligence Journal, 1(124): 139-159, 2000.
9. I. Fudos and C. Hoffmann. Correctness proof of a geometric constraint solver. International Journal of Computational Geometry & Applications, 6(4):405-420, 1996.
10. D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, 1989.
11. D. Heckerman. A tutorial on learning with bayesian networks. Technical Report MSR-TR-95-06, Microsoft Research, 1995.
12. C. M. Hoffmann and R. Joan-Arinyo. A brief on constraint solving. Computer-Aided Design and Applications, 2(5):655-663, 2005.
13. F. Jensen. An Introduction to Bayesian Networks. Springer Verlag, 1996.
14. F. Jensen. Bayesian Networks and Decision Graphs. Springer, 2001.
15. F. Jensen, S. Lauritzen, and K. Olesen. Bayesian updating in recursive graphical models by local computations. Computational Statisticals Quarterly, 4:269-282, 1990.
16. M. Luzón. Resolución de Restricciones geométricas. Selección de la Solución Deseada. PhD thesis, Dpto. de Informática. Universidade de Vigo., Septiembre 2001.
17. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA., 1998.
18. I. Rojas, J. Gonzlez, H. Pomares, J. Merelo, P. Castillo, and G. Romero. Statistical analysis of the main parameters involved in the design of a genetic algorithm. IEEE Transaction on Systems, Man and Cybernetics, 1(32):31-37, 2002.