Papers by Maria Cláudia Silva Boeres
[Proceedings 1992] IJCNN International Joint Conference on Neural Networks, 1992
Abstract The elastic-net algorithm of R. Durbin and D. Willshaw (Nature, vol. 326, p. 689-91, 198... more Abstract The elastic-net algorithm of R. Durbin and D. Willshaw (Nature, vol. 326, p. 689-91, 1987) for the traveling salesman problem works by deforming an elastic band as some of its points are attracted toward the cities. In each iteration, the influence of all cities on all ...
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2004
We propose a new strategy for solving the non-bijective graph matching problem in model-based pat... more We propose a new strategy for solving the non-bijective graph matching problem in model-based pattern recognition. The search for the best correspondence between a model and an over-segmented image is formulated as a combinatorial optimization problem, defined by the relational attributed graphs representing the model and the image where recognition has to be performed, together with the node and edge
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Palavras-chaves: correspondência de grafos, mapas conceituais, recuperação inteligente de informa... more Palavras-chaves: correspondência de grafos, mapas conceituais, recuperação inteligente de informação. Abstract. The problem of graph correspondence (PGC) consists of a problem formulated in Combinatory Optimization for the structural comparison of graphs, based on the identification of similarities. Initially proposed for applications in image recognition, this work intends to extend the PGC to an application in intelligent information retrieval, that is,
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
… and Theory of …, 2008
... The term gi represents the number of gaps in the scheduling of lessons of ... additional rest... more ... The term gi represents the number of gaps in the scheduling of lessons of ... additional restrictions to CTTP and generalize the process described to other timetable problems. ... 2007) An approach for the timetabling problem subject to constraints using graph coloring (in portuguese ...
Bookmarks Related papers MentionsView impact
This paper discusses an experience with programming courses using identification and formal repre... more This paper discusses an experience with programming courses using identification and formal representation of programming schemas and their potential for automatic analysis. A relation with Bloom’s taxonomy has been used to support the classification of these schemas. We intend to use these tools for classification as well as feedback routing with respect to source code produced by programming students.
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Uploads
Papers by Maria Cláudia Silva Boeres