866 search results - page 34 / 174 » Algorithms for Comparing Pedigree Graphs |
WEA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
ICHIT
2009
Springer
15 years 6 months ago
2009
Springer
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
139
click to vote
GECCO
2009
Springer
14 years 9 months ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
ESWS
2006
Springer
15 years 3 months ago
2006
Springer
We present a new iterative algorithm for ontology mapping where we combine standard string distance metrics with a structural similarity measure that is based on a vector represent...
105
click to vote
GECCO
2009
Springer
14 years 9 months ago
2009
Springer
This paper introduces a multiagent optimization algorithm inspired by the collective behavior of social insects. In our method, each agent encodes a possible solution of the probl...