2026-05-27T04:43:18Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/82032026-02-03T11:58:35Zcom_10630_2254col_10630_37959

Chicano-García, José-Francisco Whitley, L. Darrell Alba-Torres, Enrique 2014-10-07T09:21:30Z 2014-10-07T09:21:30Z 2014-10-07 http://hdl.handle.net/10630/8203 Uniform crossover is a popular operator used in genetic algorithms to combine two tentative solutions of a problem represented as binary strings. We use the Walsh decomposition of pseudo-Boolean functions and properties of Krawtchouk matrices to exactly compute the expected value for the fitness of a child generated by uniform crossover from two parent solutions. We prove that this expectation is a polynomial in , the probability of selecting the best-parent bit. We provide efficient algorithms to compute this polynomial for ONEMAX and MAX-kSAT problems, but the results also hold for domains such as NK-Landscapes. eng open access Algoritmos genéticos Exact computation of the expectation curves for uniform crossover conference output