--- Begin Message ---
Glynn Clements ha scritto:
[EMAIL PROTECTED] wrote:
thank you for interesting about mcda. I need help and suggest for
better coding!
- Yes, r.mcda.electre, r.mcda.regime use
G_alloc_matrix((nrows*ncols),(nrows*ncols)) with related memory
problem. I'm looking for a better algorithm, especially for pairwise
comparison that need large matrix ((nrows*ncols),(nrows*ncols)) for
derive concordance and discordance matrix. Now I don't find it but I'
still looking for. Could you give me a suggest ?.
Is this a sparse matrix? Or do you actually store a value for every
possible combination?
How is the resulting matrix used? If you don't need repeated, random
access, it would be better to calculate the values as they are
required instead of storing them.
I need matrix for storage a pairwise comparison pixel to pixel for
generate an index for each row/colum an re-generate the output grid. For
avoid the problem I'm tinking storage the value in a file... but It
dosen't a smart solution.
Thanks
gianluca
--- End Message ---
_______________________________________________
grass-dev mailing list
[email protected]
http://lists.osgeo.org/mailman/listinfo/grass-dev
