<?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:12:12Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/5612" metadataPrefix="mods">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/5612</identifier><datestamp>2026-02-03T11:27:55Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37953</setSpec></header><metadata><mods:mods xmlns:doc="http://www.lyncode.com/xoai" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
   <mods:name>
      <mods:namePart>Luque-Polo, Gabriel Jesús</mods:namePart>
   </mods:name>
   <mods:name>
      <mods:namePart>Alba-Torres, Enrique</mods:namePart>
   </mods:name>
   <mods:extension>
      <mods:dateAvailable encoding="iso8601">2013-07-15T10:12:44Z</mods:dateAvailable>
   </mods:extension>
   <mods:extension>
      <mods:dateAccessioned encoding="iso8601">2013-07-15T10:12:44Z</mods:dateAccessioned>
   </mods:extension>
   <mods:originInfo>
      <mods:dateIssued encoding="iso8601">2013</mods:dateIssued>
   </mods:originInfo>
   <mods:identifier type="citation">G. Luque, E. Alba, Math Oracles: A New Way of Designing Efficient Self-Adaptive Algorithms, Proceedings of the Genetic and Evolutionary Computation Conference Companion,pp. 217-218, GECCO'13, July 6–10, 2013, Amsterdam, The Netherlands. ACM 2013, ISBN 978-1-4503-1964-5.</mods:identifier>
   <mods:identifier type="uri">http://hdl.handle.net/10630/5612</mods:identifier>
   <mods:abstract>In this paper we present a new general  methodology to develop self-adaptive methods at a low computational cost. Instead of going purely ad-hoc we de ne several simple steps to include theoretical models as additional information in our algorithm. Our idea is to incorporate the predictive information (future behavior) provided by well-known mathematical models or other prediction systems (the oracle) to build enhanced methods. We show the main steps which should be considered to include this new kind of information into any algorithm. In addition, we actually test the idea on a speci c algorithm, a genetic algorithm (GA). Experiments show that our proposal is able to obtain similar, or even better results when it is compared to the  traditional algorithm. We also show the bene ts in terms of saving time and a lower complexity of parameter settings.</mods:abstract>
   <mods:language>
      <mods:languageTerm>eng</mods:languageTerm>
   </mods:language>
   <mods:accessCondition type="useAndReproduction">open access</mods:accessCondition>
   <mods:subject>
      <mods:topic>Lenguajes de programación</mods:topic>
   </mods:subject>
   <mods:subject>
      <mods:topic>Computación evolutiva</mods:topic>
   </mods:subject>
   <mods:subject>
      <mods:topic>Algoritmos genéticos</mods:topic>
   </mods:subject>
   <mods:titleInfo>
      <mods:title>Math Oracles: A New Way of Designing Efficient Self-Adaptive Algorithms</mods:title>
   </mods:titleInfo>
   <mods:genre>journal article</mods:genre>
</mods:mods>
</metadata></record></GetRecord></OAI-PMH>