Search results for query: *

German, I actually had something quite similar to what you proposed with the .AND. but found that .ANDing. super long arrays wasn't very helpful. However, what you said regarding the geographic location was brilliant. Wonder why I hadn't thought of it. I can separate things by other...

Hi Mikrom, The data is all numeric. I was just using A for the names of entrants, numbers for the locations and b1 for the scores to illustrate. All the names are integer(4), all the locations are integer(4) and the scores are real(8). Further more, the location and names are just IDs, which...

Sorry this sentence might be confusing: So, the algorithm simply proposes considering all single entrant reordering until there is no improvement in the score. Replace it with So, the algorithm simply proposes considering all single entrant reordering until there is no improvement in the...

Do your entrants score on any location only once or is there a chance that they get two or more scores for one location like: One score per location, if any. And what is number of locations you have? The grand total will be roughly 200,000. However, each entrant will have a maximum of 15 (the...

Thanks for trying. Its different. Let me try again to explain. I really do not think I can improve it further, but I would like to try before throwing hardware at it. Def some function Fn(INPUTS) as a function. It is completely not important. For now, suppose I give it some numbers and it gives...

Hi, I am working on a program to compare entries in a large data-set. This is for a national statistics department of a Scandinavian country. I'll describe the problem, then talk about two approaches I tried. Consider 2 entrants, A and B. A is observed at location 1 3 5 8 and B is observed...