<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-05-27T12:13:54Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/8193" metadataPrefix="rdf">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/8193</identifier><datestamp>2026-02-03T12:03:22Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37959</setSpec></header><metadata><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:ds="http://dspace.org/ds/elements/1.1/" xmlns:ow="http://www.ontoweb.org/ontology/1#" xmlns:rdf="http://www.openarchives.org/OAI/2.0/rdf/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/rdf/ http://www.openarchives.org/OAI/2.0/rdf.xsd">
   <ow:Publication rdf:about="oai:riuma.uma.es:10630/8193">
      <dc:title>Exact Computation of the Fitness-Distance Correlation for Pseudoboolean Functions with One Global Optimum</dc:title>
      <dc:creator>Chicano-García, José-Francisco</dc:creator>
      <dc:creator>Alba-Torres, Enrique</dc:creator>
      <dc:subject>Optimización combinatoria</dc:subject>
      <dc:description>Chicano, F., &amp; Alba E. (2012).  Exact Computation of the Fitness-Distance Correlation for Pseudoboolean Functions with One Global Optimum. (Hao, J-K., &amp; Middendorf M., Ed.).Evolutionary Computation in Combinatorial Optimization - 12th European Conference, EvoCOP 2012, Málaga, Spain, April 11-13, 2012. Proceedings. 111–123.</dc:description>
      <dc:description>Landscape theory provides a formal framework in which combinatorial optimization problems can be theoretically characterized as a sum of a special kind of landscapes called elementary landscapes. The decomposition of the objective function of a problem into its elementary components can be exploited to compute summary statistics. We present closed-form expressions for the fitness-distance correlation (FDC) based on the elementary landscape decomposition of the problems defined over binary strings in which the objective function has one global optimum. We present some theoretical results that raise some doubts on using FDC as a measure of problem difficulty.</dc:description>
      <dc:date>2014-10-06T10:57:08Z</dc:date>
      <dc:date>2014-10-06T10:57:08Z</dc:date>
      <dc:date>2014-10-06</dc:date>
      <dc:type>conference output</dc:type>
      <dc:identifier>http://hdl.handle.net/10630/8193</dc:identifier>
      <dc:language>eng</dc:language>
      <dc:relation>European Conference on Evolutionary Computation in Combinatorial Optimization</dc:relation>
      <dc:relation>Málaga, Spain</dc:relation>
      <dc:relation>11/4/2012</dc:relation>
      <dc:rights>open access</dc:rights>
   </ow:Publication>
</rdf:RDF>
</metadata></record></GetRecord></OAI-PMH>