Sciweavers

6894 search results - page 328 / 1379
» Generation Problems
Sort
View
GECCO
2004
Springer
16 years 3 days ago
Virtual Ramping of Genetic Programming Populations
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...
Thomas Fernandez
158
Voted
HT
2000
ACM
15 years 11 months ago
Linking by interacting: a paradigm for authoring hypertext
Authoring hypertext structures has always been a difficult task. The cognitive overhead problem, well known from authors when creating structured hyperdocuments, has been tackled ...
Maria da Graça Campos Pimentel, Gregory D. ...
CP
2000
Springer
15 years 11 months ago
New Search Heuristics for Max-CSP
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...
Kalev Kask
COCO
2010
Springer
139views Algorithms» more  COCO 2010»
15 years 10 months ago
On Matrix Rigidity and Locally Self-Correctable Codes
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...
Zeev Dvir
HAIS
2009
Springer
15 years 10 months ago
Beyond Homemade Artificial Data Sets
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...
Núria Macià, Albert Orriols-Puig, Es...