This paper investigates how Felzenszwalb’s and Huttenlocher’s graph-based segmentation algorithm can be improved by automatic programming. We show that computers running Automatic Design of Algorithms Through Evolution (ADATE), our system for automatic programming, have induced a new graph-based algorithm that is 12 percent more accurate than the original without affecting the runtime efficienc...

Memory management is one of the most fundamental programming issues. Knowing the important aspects of how to manage the memory in your programming environment is critical for effective programming. There are languages, like Java, which provide an internal automatic mechanism for managing memory, but that does not make memory management less important. In other languages like C++ you have to do ...

This chapter describes how the biological theory of gene duplication described in Susumu Ohno's provocative book, Evolution by Means of Gene Duplication, was brought to bear on a vexatious problem from the domain of automated machine learning. The goal of automatic programming is to create, in an automated way, a computer program that enables a computer to solve a problem. Ideally, an automatic...

The recently developed genetic programming paradigm provides a way to genetically breed a population of computer programs to solve problems. The technique of automatic function definition enables genetic programming to define potentially useful functions dynamically during a run – much as a human programmer writing a computer program creates subroutines to perform certain groups of steps which ...

We have considered edge detection as a classification problem, and we have applied two popular machine learning techniques to the problem and compared their best results to that of automatic programming. We show that ADATE, our system for automatic programming, is capable of producing solutions that are as good as, or better than, the best solutions generated by two other machine learning techn...

Read more and get great! That's what the book enPDFd genetic programming ii automatic discovery of reusable programs will give for every reader to read this book. This is an on-line book provided in this website. Even this book becomes a choice of someone to read, many in the world also loves it so much. As what we talk, when you read more every page of this genetic programming ii automatic dis...

It would be desirable if computers could solve problems without the need for a human to write the detailed programmatic steps. That is, it would be desirable to have a domainindependent automatic programming technique in which "What You Want Is What You Get" ("WYWIWYG" – pronounced "wow-eee-wig"). Indeed, automatic programming is one of the central problems of computer science. Paraphrasing Art...

Automatic mineral identification using evolutionary computation technology is discussed. Thin sections of mineral samples are digitally photographed using a computercontrolled rotating polarizer stage on a petrographic microscope. A suite of image processing functions is applied to the images. Filtered image data for identified mineral grains is then selected for use as training data for a gene...

The ability to program is one of the core tools used by computer scientists, and programming proficiency is a recommended requirement for ABET accreditation. In our experience, students learn programming skills best by writing many programs, ranging from simple to complex. Overworked teachers can be dismayed by the prospect of grading still more programs per student as well as teaching introduc...

Memo functions and memoization are well-known concepts in A I programming. They have been discussed since the Sixties and are ofien used as ezamples in introductory programming texts. However, the automation of memoization as a practical sofiware engineering tool f o r A I systems has not received a detailed treatment. This paper describes how automatic memoization can be made viable on a large...