Implement adaptive generation of benchmarks

The original brainy generates benchmarks until they have at least k benchmarks where collection c wins, for each collection c. In brainy, k = 10 000.

JBrainy just uses a fixed number of seeds. It doesn't generate more of them if it doesn't have enough benchmarks where one of them wins.