Most symbolic classifiers aim at building sets of rules with good coverage and precision. While this is suitable for most applications, they tend to neglect other desirable proper...
Rafael Giusti, Gustavo E. A. P. A. Batista, Ronald...
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
— One of the main tasks software testing involves is the generation of the test inputs to be used during the test. Due to its expensive cost, the automation of this task has beco...
Thirteen years have passed since Karl Sims published his work on evolving virtual creatures. Since then, several novel approaches to neural network evolution and genetic algorithm...