In our entry to the new HARD track, we have investigated two methods of interactively refining user search formulations. One method consists of asking the user to select a number ...
A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in terms of the so called central distribution. This new searc...
When performing discussion search it might be desirable to consider non-topical measures like the number of positive and negative replies to a posting, for instance as one possibl...
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
Recently, a small number of papers have appeared in which the authors implement stochastic search algorithms, such as evolutionary computation, to generate game content, such as le...
Julian Togelius, Georgios N. Yannakakis, Kenneth O...