Polynomials, Basis Sets, and Deceptiveness in Genetic Algorithms
نویسندگان
چکیده
Abst ract . The degree to which the genetic opt imizat ion process is transparent is in part determined by the form of th e object ive funct ion. We develop two forms from first principles: polynomial forms and basis sets. We characterize three function classes that are fully easy for the genetic algorithm in terms of the polynomial representation. We generate functions of varying degrees of decepti veness in terms of the representation provided by basis sets. We furth er show the relationship between these representations and the more standard Walsh polynomia ls.
منابع مشابه
Boolean Gröbner Basis Reductions on Datapath Circuits Using the Unate Cube Set Algebra
Recent developments in formal datapath verification make efficient use of symbolic computer algebra algorithms for formal verification. The circuit is modeled as a set of polynomials over Boolean (or pseudo-Boolean) rings, and Gröbner basis (GB) reductions are performed over these polynomials to derive a canonical representation. GB reductions of Boolean polynomials tend to cause intermediate e...
متن کاملUsing an Imperialistic Competitive Algorithm in Global Polynomials Optimization (Case Study: 2D Geometric Correction of IKONOS and SPOT Imagery)
The number of high resolution space imageries in photogrammetry and remote sensing society is growing fast. Although these images provide rich data, the lack of sensor calibration information and ephemeris data does not allow the users to apply precise physical models to establish the functional relationship between image space and object space. As an alternative solution, some generalized mode...
متن کاملA New Hybrid model of Multi-layer Perceptron Artificial Neural Network and Genetic Algorithms in Web Design Management Based on CMS
The size and complexity of websites have grown significantly during recent years. In line with this growth, the need to maintain most of the resources has been intensified. Content Management Systems (CMSs) are software that was presented in accordance with increased demands of users. With the advent of Content Management Systems, factors such as: domains, predesigned module’s development, grap...
متن کاملDivision algorithms for Bernstein polynomials
Three division algorithms are presented for univariate Bernstein polynomials: an algorithm for finding the quotient and remainder of two univariate polynomials, an algorithm for calculating the GCD of an arbitrary collection of univariate polynomials, and an algorithm for computing a μ-basis for the syzygy module of an arbitrary collection of univariate polynomials. Division algorithms for mult...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Complex Systems
دوره 5 شماره
صفحات -
تاریخ انتشار 1991