We submit that adaptation in recombinative evolutionary systems is powered by an implicit form of computation called Hypomixability Elimination. We describe hypomixability elimination, and provide evidence that it can be performed efficiently by recombinative evolutionary systems. Specifically we show that hypomixability elimination in a simple genetic algorithm can be used to obtain optimal bo...

Follow this and additional works at: http://engagedscholarship.csuohio.edu/enece_facpub Part of the Computer Engineering Commons Publisher's Statement NOTICE: this is the author’s version of a work that was accepted for publication in International Journal of Approximate Reasoning. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, a...

Given a fuzzy logic system, how can we determine the membership functions that will result in the best performance? If we constrain the membership functions to a speci ̄c shape (e.g., triangles or trapezoids) then each membership function can be parameterized by a few variables and the membership optimization problem can be reduced to a parameter optimization problem. The parameter optimization ...