[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Bug-gnubg] Optimization: Pivoting the input vector and weights matr

From: Øystein O Johansen
Subject: Re: [Bug-gnubg] Optimization: Pivoting the input vector and weights matrix.
Date: Thu, 21 Apr 2005 09:51:17 +0200

> Is it possible, when entering the Evaluation function, to
> pivot the weight matrix and the input vector and store the
> order in a local index array? We sort the input vector (and
> the weight matrix) such that all the zeros are at the the end.


I've been thinking a bit further on this. In the sorting process
we have to do a comparing of inputs to each other in the sorting
algorithm. Even qsort must do that. We have to loop over the 250
inputs. For each comparing we have to move a index into the index

In the input loop today we compare the input to 0.0 and if true
we move a pointer.

I believe each step in the sorting process will be more than one
comparing and a pointer movement. I therefore also believe that
the idea must be rejected.

Maybe this algorithm idea can improve something in other
applications, but not in our project. (Unless someone finds a
superfast hardware accelrated sorting system.)


The information contained in this message may be CONFIDENTIAL and is
intended for the addressee only. Any unauthorised use, dissemination of the
information or copying of this message is prohibited. If you are not the
addressee, please notify the sender immediately by return e-mail and delete
this message.
Thank you.

reply via email to

[Prev in Thread] Current Thread [Next in Thread]