3 search results - page 1 / 1 » On a Combinatorial Problem of Asmus Schmidt |
COMBINATORICS
2004
13 years 10 months ago
2004
For any integer r 2, define a sequence of numbers {c (r) k }k=0,1,..., independent of the parameter n, by n k=0 n k r n + k k r = n k=0 n k n + k k c (r) k , n = 0, 1, 2, . . . ....
JUCS
2008
13 years 10 months ago
2008
: Evolutionary algorithms are effective search tools for tackling difficult optimization problems. In this paper an algorithm based on living processes where cooperation is the mai...
EMMCVPR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...