Good guess.
I'm developing a heuristic for the multivariate gcd over Z in
Singular. And I must admit not having thought enough about the
advantages of a statistical analysis. Its transparency beats SA and
NN. Now I'm working on the statistical approach. At the moment, I'm
trying to define the prob
On Apr 24, 11:19 pm, Achim <[EMAIL PROTECTED]> wrote:
> Has
> anyone experience with simulated annealing?
well, a bit, what exactly do you want to do? i have no idea so i'm
just guessing:
you extract "statistical" parameters out of the input and then choose
the appropriate algorithm? SA or simi
Hello folks!
Thank you, Michael, for introducing me.
To me it seems sensible, that a fast gcd implementation should consist
of a bunch of algorithms and a heuristic, that chooses one of them in
dependence of the input. Currently I'm working on the heuristic. I'm
thinking about letting the comput
