<?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-06-02T02:15:41Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/10218" metadataPrefix="qdc">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/10218</identifier><datestamp>2026-02-03T11:09:26Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37953</setSpec></header><metadata><qdc:qualifieddc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Elementary Landscape Decomposition of the Test Suite Minimization Problem</dc:title>
   <dc:creator>Chicano-García, José-Francisco</dc:creator>
   <dc:creator>Ferrer-Urbano, Francisco Javier</dc:creator>
   <dc:creator>Alba-Torres, Enrique</dc:creator>
   <dc:subject>Ingeniería del software</dc:subject>
   <dcterms:abstract>Landscape theory provides a formal framework in which combinatorial optimization problems can be theoretically characterized as a sum of a special kind of landscape called elementary landscape. The decomposition of the objective function of a problem into its elementary components provides additional knowledge on the problem that can be exploited to create new search methods for the problem. We analyze the Test Suite Minimization problem in Regression Testing from the point of view of landscape theory. We find the elementary landscape decomposition of the problem and propose a practical application of such decomposition for the search.</dcterms:abstract>
   <dcterms:dateAccepted>2015-09-07T11:24:34Z</dcterms:dateAccepted>
   <dcterms:available>2015-09-07T11:24:34Z</dcterms:available>
   <dcterms:created>2015-09-07T11:24:34Z</dcterms:created>
   <dcterms:issued>2015-09-07</dcterms:issued>
   <dc:type>journal article</dc:type>
   <dc:identifier>http://hdl.handle.net/10630/10218</dc:identifier>
   <dc:identifier>http://orcid.org/0000-0003-1259-2990</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>Symposium on Search Based Software Engineering</dc:relation>
   <dc:relation>Szeged, Hungary</dc:relation>
   <dc:relation>September 2011</dc:relation>
   <dc:rights>open access</dc:rights>
   <dc:rights>by-nc-nd</dc:rights>
</qdc:qualifieddc>
</metadata></record></GetRecord></OAI-PMH>