3 search results - page 1 / 1 » On a Combinatorial Problem of Asmus Schmidt |
83
Voted
COMBINATORICS
2004
15 years 12 days 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, . . . ....
112
click to vote
JUCS
2008
15 years 15 days 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...
125
click to vote
EMMCVPR
2007
Springer
15 years 4 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...