5 citations found. Retrieving documents...
P. F. Stadler. Spectral landscape theory. In J. P. Crutchfield and P. Schuster, editors, Evolutionary Dynamics --- Exploring the Interplay of Selection, Neutrality, Accident and Function. Oxford University Press, New York, 1999. To appear.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Towards the Automatic Design Of More Efficient Digital.. - Vassilev, Job, Miller (2000)   (1 citation)  (Correct)

.... The circuit evolution landscapes are characterised with neutrality [28, 13] that appeared to be beneficial for the evolutionary design of circuits [3] and particularly the three bit multiplier [25] Neutrality is a landscape characteristic that refers to genotypes with equal fitness values [19, 21]. The set of genotypes with equal fitness values is called a neutral network, if the genotypes define a connected subgraph in the landscape. Electronic circuits have been evolved and it has been reported that the obtained solutions significantly differ in con struction from the conventional ....

P. F. Stadler. Spectral landscape theory. In J. P. Crutchfield and P. Schuster, editors, Evolutionary Dynamics --- Exploring the Interplay of Selection, Neutrality, Accident and Function. Oxford University Press, New York, 1999. To appear.


The Advantages of Landscape Neutrality in Digital Circuit.. - Vassilev, Miller (2000)   (4 citations)  (Correct)

....are the functionality, internal connectivity, and output connectivity landscapes. In general they are characterised with neutral networks and sharply differentiated plateaus. A set of genotypes defines a neutral network if the set represents a connected subgraph of genotypes with equal fitnesses [18, 19]. This characteristic of fitness landscapes is referred to as neutrality. The landscape neutrality in digital circuit evolution originates mainly from the genotype phenotype mapping by which a digital circuit is encoded into a genotype. The mapping is defined in such a way that it allows ....

Stadler, P.F.: Spectral landscape theory. In Crutchfield, J.P., Schuster, P., eds.: Evolutionary Dynamics --- Exploring the Interplay of Selection, Neutrality, Accident and Function. Oxford University Press, New York (1999).


Landscapes and Effective Fitness - Stadler, Stephens (2003)   (2 citations)  Self-citation (Stadler)   (Correct)

....landscapes and various relevant transformations on them we pass now to the topic of how to characterize landscapes geometrically. Geometric characterization of static landscapes, which form a possible basis for a classification of landscapes, were the topic of recent reviews by one of the authors [8, 79, 72]; we therefore touch this topic only very briefly. It turns out that the ruggedness of landscape is intimately related to epistasis [80, 48] where epistasis is defined as the non additive component of the fitness function. In the Walsh basis additive and epistatic interactions are separated: The ....

....little progress has been made in this direction, see however [98, 99] There have been several attempts to identify properties of fitness functions that relate to the action of recombination operators. Probably the most import one is the concept of a deceptive function [100, 101, 102] see also [103, 79]. A landscape is deceptive (for a Genetic Algorithm) if the BBs for an optimal schema are less fit than the corresponding BBs for a non optimal schema on the same partition. For example, if the optimum is 11 and the BB 1# is less fit than the BB 0#. Deception has inevitably been portrayed in the ....

Stadler, P. F. Spectral landscape theory. In: Crutchfield, J. P. and Schuster, P., editors, Evolutionary Dynamics---Exploring the Interplay of Selection, Neutrality, Accident, and Function. Oxford University Press, 2002. In press.


Landscapes on Spaces of Trees - Bastert, Rockmore, Stadler, Tinhofer (2001)   (1 citation)  Self-citation (Stadler)   (Correct)

....of #, i.e. for which B(#) 1 for one eigenvalue # #= 0 and B(# # ) 0 for all # # #= # is called elementary. This notion is important because on the one hand many of the best studied combinatorial optimization problems form elementary landscapes on their natural configurations graphs [24, 42, 43], and on the other hand eigenfunctions of the graphs Laplacian have a number of distinct geometric properties: All their local minima have a value below the landscape average [24] and they satisfy a version of Courant s nodal domain theorem, implying that ruggedness indeed increases with the ....

P. F. Stadler. Spectral landscape theory. In J. P. Crutchfield and P. Schuster, editors, Evolutionary Dynamics---Exploring the Interplay of Selection, Neutrality, Accident, and Function. Oxford University Press, 2000. in press.


Towards the Automatic Design of More Efficient Digital Circuits - Vassilev, Job, al. (2000)   (1 citation)  (Correct)

No context found.

P. F. Stadler. Spectral landscape theory. In J. P. Crutchfield and P. Schuster, editors, Evolutionary Dynamics --- Exploring the Interplay of Selection, Neutrality, Accident and Function. Oxford University Press, New York, 1999. To appear.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC