32545 search results - page 777 / 6509 » Data Structures and Algorithms |
162
Voted
COLING
1994
15 years 9 months ago
1994
The revised graph unification algorithms presented here are more efficient because they reduce the amount of copying that was necessary because of the assumption that data-structu...
148
click to vote
IPL
2006
15 years 7 months ago
2006
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
197
Voted
AAECC
2002
Springer
15 years 7 months ago
2002
Springer
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
272
Voted
ISAAC
2010
Springer
15 years 5 months ago
2010
Springer
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
188
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
In the classical binary genetic algorithm, although crossover within a building block (BB) does not always cause a decrease in fitness, any decrease in fitness results from the ...