Caltech scientists have found a fast and efficient way to add up large numbers of Feynman diagrams, the simple drawings ...

In this paper, we present a greedy-based algorithm for matching UML class diagrams based on their lexical, internal, neighborhood similarity, and a combination of them. Additionally the paper ...

In the context of Mobile Robotics, the efficient resolution of the Path Planning problem is a key task. The model of the environment and the search algorithm are basic issues in the resolution of the ...