As important as finding a solution to the game of MasterMind that is better than anyone else is to find one that can be applied to a wide range of sizes. In this paper we get rid of a parameter, the limit size of the consistent set we use for scoring every combination. This makes a faster algorithm, and not always worse than the optimal consistent set size.
This was the paper presented at LION by Antonio Fernández using this presentation
Why not use Dropbox as its name implies, as a box for dropping individuals that could be interchanged among different islands running evolutionary algorithms?
That’s exactly what we are doing in a series of papers that are being published and presented in IWDECIE, CEC 2011 and GECCO, in last-in, first-out order. This presentation is for the second, presented today in CEC.
What we try to test in this paper is whether we can add a good number of computers (up to 4) without a saturation of the network (or of Dropbox itself), and whether there is a difference between wired and wireless. It so happens there is, but it gets smaller when you increase the number of computers.
Still many tests to to, but for the time being this looks promising. We’ll link the paper when it’s available. For the time being, if you’re interested just send us an email