#### Filter Results:

- Full text PDF available (73)

#### Publication Year

1980

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Edwin D. de Jong, Jordan B. Pollack
- Evolutionary Computation
- 2004

In many problems of interest, performance can be evaluated using tests, such as examples in concept learning, test points in function approximation, and opponents in game-playing. Evaluation on all tests is often infeasible. Identification of an accurate evaluation or fitness function is a difficult problem in itself, and approximations are likely to… (More)

- Edwin D. de Jong
- GECCO
- 2005

Coevolution can be used to adaptively choose the tests used for evaluating candidate solutions. A long-standing question is how this dynamic setup may be organized to yield reliable search methods. Reliability can only be considered in connection with a particular solution concept specifying what constitutes a solution. Recently, monotonic coevolution… (More)

- Edwin D. de Jong
- GECCO
- 2004

Coevolution can in principle provide progress for problems where no accurate evaluation function is available. An important open question however is how coevolution can be set up such that progress can be ensured. Previous work has provided progress guarantees either for limited cases or using strict acceptance conditions that can result in stalling. We… (More)

- Anthony Bucci, Jordan B. Pollack, Edwin D. de Jong
- GECCO
- 2004

Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of problem structure can be made precise, and propose a formal definition of problem structure. The definition is applicable to problems in which the quality of candidate solutions is… (More)

- Edwin D. de Jong, Richard A. Watson, Dirk Thierens
- GECCO
- 2005

Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order <i>k</i>. Problems with higher order dependencies can only be addressed efficiently if further problem properties exist that can be exploited. An important class of problems for which this occurs is that of hierarchical problems.… (More)

- Edwin D. de Jong, Anthony Bucci
- GECCO
- 2006

Coevolution has often been based on averaged outcomes, resulting in unstable evaluation. Several theoretical approaches have used archives to provide stable evaluation. However, the number of tests required by some of these approaches can be prohibitive of practical applications. Recent work has shown the existence of a set of underlying objectives which… (More)

- Timothy J. Hickey, Marc Toussaint, +6 authors Shiva Viswanathan
- 2007

Emergent Geometric Organization and Informative Dimensions in Coevolutionary Algorithms A dissertation presented to the Faculty of the Graduate School of Arts and Sciences of Brandeis University, Waltham, Massachusetts by Anthony Bucci Coevolutionary algorithms vary entities which can play two or more distinct, interacting roles, with the hope of producing… (More)

- Peter A. N. Bosman, Edwin D. de Jong
- GECCO
- 2005

Various multi--objective evolutionary algorithms (MOEAs) have obtained promising results on various numerical multi--objective optimization problems. The combination with gradient--based local search operators has however been limited to only a few studies. In the single--objective case it is known that the additional use of gradient information can be… (More)

In this paper we present a new Estimation–of–Distribution Algorithm (EDA) for Genetic Programming (GP). We propose a probability distribution for the space of trees, based on a grammar. To introduce dependencies into the distribution, grammar transformations are performed that facilitate the description of specific subfunctions. We present some results from… (More)

- Edwin D. de Jong
- IEEE Congress on Evolutionary Computation
- 2004

Coevolution offers adaptive methods for the selection of tests used to evaluate individuals, but the resulting evaluation can be unstable. Recently, general archive-based coevolution methods have become available for which monotonic progress can be guaranteed. The size of these archives may grow indefinitely however, thus limiting their application… (More)