Sciweavers

52 search results - page 2 / 11
» The Difficulty of Programming Contests Increases
Sort
View
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
15 years 8 months ago
Towards identifying populations that increase the likelihood of success in genetic programming
This paper presents a comprehensive, multivariate account of how initial population material is used over the course of a genetic programming run as while various factors influenc...
Jason M. Daida
AAAI
2006
15 years 4 months ago
On the Difficulty of Modular Reinforcement Learning for Real-World Partial Programming
In recent years there has been a great deal of interest in "modular reinforcement learning" (MRL). Typically, problems are decomposed into concurrent subgoals, allowing ...
Sooraj Bhat, Charles Lee Isbell Jr., Michael Matea...
SOQUA
2007
15 years 4 months ago
ConTest listeners: a concurrency-oriented infrastructure for Java test and heal tools
With the proliferation of the new multi-core personal computers, and the explosion of the usage of highly concurrent machine configuration, concurrent code moves from being writt...
Yarden Nir-Buchbinder, Shmuel Ur
UM
2007
Springer
15 years 9 months ago
Eliciting Adaptation Knowledge from On-Line Tutors to Increase Motivation
In the classroom, teachers know how to motivate their students and how to exploit this knowledge to adapt or optimize their instruction when a student shows signs of demotivation. ...
Teresa Hurley, Stephan Weibelzahl
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
15 years 6 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule