Abstract. Genetic Programming often uses excessive computational resources because the population size and the maximum number of generations per run are not optimized. We have deve...
Authoring hypertext structures has always been a difficult task. The cognitive overhead problem, well known from authors when creating structured hyperdocuments, has been tackled ...
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
One of the most important challenges in supervised learning is how to evaluate the quality of the models evolved by different machine learning techniques. Up to now, we have relied...