<> <http://www.w3.org/2000/01/rdf-schema#comment> "The repository administrator has not yet configured an RDF license."^^<http://www.w3.org/2001/XMLSchema#string> .
<> <http://xmlns.com/foaf/0.1/primaryTopic> <https://discovery.ucl.ac.uk/id/eprint/1490740> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Article> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/dc/terms/title> "Learning Combinatorial Interaction Test Generation Strategies Using Hyperheuristic Search"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/ontology/bibo/abstract> "The surge of search based software engineering research has been hampered by the need to develop customized search algorithms for different classes of the same problem. For instance, two decades of bespoke Combinatorial Interaction Testing (CIT) algorithm development, our exemplar problem, has left software engineers with a bewildering choice of CIT techniques, each specialized for a particular task. This paper proposes the use of a single hyperheuristic algorithm that learns search strategies across a broad range of problem instances, providing a single generalist approach. We have developed a Hyperheuristic algorithm for CIT, and report experiments that show that our algorithm competes with known best solutions across constrained and unconstrained problems: For all 26 real-world subjects, it equals or outperforms the best result previously reported in the literature. We also present evidence that our algorithm's strong generic performance results from its unsupervised learning. Hyperheuristic search is thus a promising way to relocate CIT design intelligence from human to machine."^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/dc/terms/date> "2015-05-24" .
<https://discovery.ucl.ac.uk/id/document/391118> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Document> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/ontology/bibo/volume> "37" .
<https://discovery.ucl.ac.uk/id/org/ext-af0a9a5baed87c407844a3f5db44597c> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Organization> .
<https://discovery.ucl.ac.uk/id/org/ext-af0a9a5baed87c407844a3f5db44597c> <http://xmlns.com/foaf/0.1/name> "IEEE"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/dc/terms/publisher> <https://discovery.ucl.ac.uk/id/org/ext-af0a9a5baed87c407844a3f5db44597c> .
<https://discovery.ucl.ac.uk/id/publication/ext-83d4d492ff07055fd17893a4534f3a53> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Collection> .
<https://discovery.ucl.ac.uk/id/publication/ext-83d4d492ff07055fd17893a4534f3a53> <http://xmlns.com/foaf/0.1/name> "2015 IEEE/ACM 37TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, VOL 1"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/dc/terms/isPartOf> <https://discovery.ucl.ac.uk/id/publication/ext-83d4d492ff07055fd17893a4534f3a53> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/ontology/bibo/status> <http://purl.org/ontology/bibo/status/published> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-d66dde91a28db29b0d67ddd1fb2525c4> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/1490740#authors> .
<https://discovery.ucl.ac.uk/id/eprint/1490740#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_1> <https://discovery.ucl.ac.uk/id/person/ext-d66dde91a28db29b0d67ddd1fb2525c4> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-f3f20dc8292395deee054fa47dcbe651> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/1490740#authors> .
<https://discovery.ucl.ac.uk/id/eprint/1490740#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_2> <https://discovery.ucl.ac.uk/id/person/ext-f3f20dc8292395deee054fa47dcbe651> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-e8db8226746d8456fe2b32652cae7253> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/1490740#authors> .
<https://discovery.ucl.ac.uk/id/eprint/1490740#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_3> <https://discovery.ucl.ac.uk/id/person/ext-e8db8226746d8456fe2b32652cae7253> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-e3c4dec34f1aa44d2a015a5cb89b3ec7> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/1490740#authors> .
<https://discovery.ucl.ac.uk/id/eprint/1490740#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_4> <https://discovery.ucl.ac.uk/id/person/ext-e3c4dec34f1aa44d2a015a5cb89b3ec7> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://www.loc.gov/loc.terms/relators/EDT> <https://discovery.ucl.ac.uk/id/person/ext-173a6f00fa7059ba9e6b46c1cf788b39> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/ontology/bibo/editorList> <https://discovery.ucl.ac.uk/id/eprint/1490740#editors> .
<https://discovery.ucl.ac.uk/id/eprint/1490740#editors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_1> <https://discovery.ucl.ac.uk/id/person/ext-173a6f00fa7059ba9e6b46c1cf788b39> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://www.loc.gov/loc.terms/relators/EDT> <https://discovery.ucl.ac.uk/id/person/ext-198f38629dc76660d1e6aa35ab344fef> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/ontology/bibo/editorList> <https://discovery.ucl.ac.uk/id/eprint/1490740#editors> .
<https://discovery.ucl.ac.uk/id/eprint/1490740#editors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_2> <https://discovery.ucl.ac.uk/id/person/ext-198f38629dc76660d1e6aa35ab344fef> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://www.loc.gov/loc.terms/relators/EDT> <https://discovery.ucl.ac.uk/id/person/ext-93a9a4168b54a2aeecf73b4dd45b868c> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/ontology/bibo/editorList> <https://discovery.ucl.ac.uk/id/eprint/1490740#editors> .
<https://discovery.ucl.ac.uk/id/eprint/1490740#editors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_3> <https://discovery.ucl.ac.uk/id/person/ext-93a9a4168b54a2aeecf73b4dd45b868c> .
<https://discovery.ucl.ac.uk/id/person/ext-d66dde91a28db29b0d67ddd1fb2525c4> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-d66dde91a28db29b0d67ddd1fb2525c4> <http://xmlns.com/foaf/0.1/givenName> "Y"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-d66dde91a28db29b0d67ddd1fb2525c4> <http://xmlns.com/foaf/0.1/familyName> "Jia"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-d66dde91a28db29b0d67ddd1fb2525c4> <http://xmlns.com/foaf/0.1/name> "Y Jia"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-198f38629dc76660d1e6aa35ab344fef> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-198f38629dc76660d1e6aa35ab344fef> <http://xmlns.com/foaf/0.1/givenName> "S"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-198f38629dc76660d1e6aa35ab344fef> <http://xmlns.com/foaf/0.1/familyName> "Elbaum"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-198f38629dc76660d1e6aa35ab344fef> <http://xmlns.com/foaf/0.1/name> "S Elbaum"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-e8db8226746d8456fe2b32652cae7253> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-e8db8226746d8456fe2b32652cae7253> <http://xmlns.com/foaf/0.1/givenName> "M"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-e8db8226746d8456fe2b32652cae7253> <http://xmlns.com/foaf/0.1/familyName> "Harman"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-e8db8226746d8456fe2b32652cae7253> <http://xmlns.com/foaf/0.1/name> "M Harman"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-e3c4dec34f1aa44d2a015a5cb89b3ec7> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-e3c4dec34f1aa44d2a015a5cb89b3ec7> <http://xmlns.com/foaf/0.1/givenName> "J"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-e3c4dec34f1aa44d2a015a5cb89b3ec7> <http://xmlns.com/foaf/0.1/familyName> "Petke"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-e3c4dec34f1aa44d2a015a5cb89b3ec7> <http://xmlns.com/foaf/0.1/name> "J Petke"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-93a9a4168b54a2aeecf73b4dd45b868c> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-93a9a4168b54a2aeecf73b4dd45b868c> <http://xmlns.com/foaf/0.1/givenName> "G"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-93a9a4168b54a2aeecf73b4dd45b868c> <http://xmlns.com/foaf/0.1/familyName> "Canfora"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-93a9a4168b54a2aeecf73b4dd45b868c> <http://xmlns.com/foaf/0.1/name> "G Canfora"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-f3f20dc8292395deee054fa47dcbe651> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-f3f20dc8292395deee054fa47dcbe651> <http://xmlns.com/foaf/0.1/givenName> "MB"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-f3f20dc8292395deee054fa47dcbe651> <http://xmlns.com/foaf/0.1/familyName> "Cohen"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-f3f20dc8292395deee054fa47dcbe651> <http://xmlns.com/foaf/0.1/name> "MB Cohen"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-173a6f00fa7059ba9e6b46c1cf788b39> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-173a6f00fa7059ba9e6b46c1cf788b39> <http://xmlns.com/foaf/0.1/givenName> "A"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-173a6f00fa7059ba9e6b46c1cf788b39> <http://xmlns.com/foaf/0.1/familyName> "Bertolino"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-173a6f00fa7059ba9e6b46c1cf788b39> <http://xmlns.com/foaf/0.1/name> "A Bertolino"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Article> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/ontology/bibo/presentedAt> <https://discovery.ucl.ac.uk/id/event/ext-2bd51c060033db605cb1c4958b6ae18b> .
<https://discovery.ucl.ac.uk/id/event/ext-2bd51c060033db605cb1c4958b6ae18b> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Conference> .
<https://discovery.ucl.ac.uk/id/event/ext-2bd51c060033db605cb1c4958b6ae18b> <http://purl.org/dc/terms/title> "2015 IEEE ACM 37th IEEE International Conference on Software Engineering"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/event/ext-2bd51c060033db605cb1c4958b6ae18b> <http://purl.org/NET/c4dm/event.owl#place> <https://discovery.ucl.ac.uk/id/location/ext-fabd4eeff2cf391efa215f7b39b40af9> .
<https://discovery.ucl.ac.uk/id/event/ext-2bd51c060033db605cb1c4958b6ae18b> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/NET/c4dm/event.owl#Event> .
<https://discovery.ucl.ac.uk/id/event/ext-2bd51c060033db605cb1c4958b6ae18b> <http://purl.org/NET/c4dm/event.owl#place> <https://discovery.ucl.ac.uk/id/location/ext-fabd4eeff2cf391efa215f7b39b40af9> .
<https://discovery.ucl.ac.uk/id/location/ext-fabd4eeff2cf391efa215f7b39b40af9> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2003/01/geo/wgs84_pos#SpatialThing> .
<https://discovery.ucl.ac.uk/id/location/ext-fabd4eeff2cf391efa215f7b39b40af9> <http://www.w3.org/2000/01/rdf-schema#label> "Florence, ITALY"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/EPrint> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/ProceedingsSectionEPrint> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/dc/terms/isPartOf> <https://discovery.ucl.ac.uk/id/repository> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/document/391118> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/391118> <http://www.w3.org/2000/01/rdf-schema#label> "Learning Combinatorial Interaction Test Generation Strategies Using Hyperheuristic Search (Text)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://purl.org/dc/elements/1.1/hasVersion> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://eprints.org/ontology/hasAccepted> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/document/391118> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/1490740/1/Jia_Learning_Combinatorial_2015_ICSE.pdf> .
<https://discovery.ucl.ac.uk/id/document/391118> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/1490740/1/Jia_Learning_Combinatorial_2015_ICSE.pdf> .
<https://discovery.ucl.ac.uk/id/eprint/1490740/1/Jia_Learning_Combinatorial_2015_ICSE.pdf> <http://www.w3.org/2000/01/rdf-schema#label> "Jia_Learning_Combinatorial_2015_ICSE.pdf"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/391119> .
<https://discovery.ucl.ac.uk/id/document/391119> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/391119> <http://www.w3.org/2000/01/rdf-schema#label> "Learning Combinatorial Interaction Test Generation Strategies Using Hyperheuristic Search (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/391119> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/document/391119> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/document/391119> <http://eprints.org/relation/islightboxThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/391120> .
<https://discovery.ucl.ac.uk/id/document/391120> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/391120> <http://www.w3.org/2000/01/rdf-schema#label> "Learning Combinatorial Interaction Test Generation Strategies Using Hyperheuristic Search (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/391120> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/document/391120> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/document/391120> <http://eprints.org/relation/ispreviewThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/391121> .
<https://discovery.ucl.ac.uk/id/document/391121> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/391121> <http://www.w3.org/2000/01/rdf-schema#label> "Learning Combinatorial Interaction Test Generation Strategies Using Hyperheuristic Search (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/391121> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/document/391121> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/document/391121> <http://eprints.org/relation/ismediumThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/391122> .
<https://discovery.ucl.ac.uk/id/document/391122> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/391122> <http://www.w3.org/2000/01/rdf-schema#label> "Learning Combinatorial Interaction Test Generation Strategies Using Hyperheuristic Search (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/391122> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/document/391122> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/document/391122> <http://eprints.org/relation/issmallThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/391129> .
<https://discovery.ucl.ac.uk/id/document/391129> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/391129> <http://www.w3.org/2000/01/rdf-schema#label> "Learning Combinatorial Interaction Test Generation Strategies Using Hyperheuristic Search (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/391129> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/document/391129> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/document/391129> <http://eprints.org/relation/isIndexCodesVersionOf> <https://discovery.ucl.ac.uk/id/document/391118> .
<https://discovery.ucl.ac.uk/id/document/391129> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/1490740/6/indexcodes.txt> .
<https://discovery.ucl.ac.uk/id/document/391129> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/1490740/6/indexcodes.txt> .
<https://discovery.ucl.ac.uk/id/eprint/1490740/6/indexcodes.txt> <http://www.w3.org/2000/01/rdf-schema#label> "indexcodes.txt"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1490740> <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://discovery.ucl.ac.uk/id/eprint/1490740/> .
<https://discovery.ucl.ac.uk/id/eprint/1490740/> <http://purl.org/dc/elements/1.1/title> "HTML Summary of #1490740 \n\nLearning Combinatorial Interaction Test Generation Strategies Using Hyperheuristic Search\n\n" .
<https://discovery.ucl.ac.uk/id/eprint/1490740/> <http://purl.org/dc/elements/1.1/format> "text/html" .
<https://discovery.ucl.ac.uk/id/eprint/1490740/> <http://xmlns.com/foaf/0.1/primaryTopic> <https://discovery.ucl.ac.uk/id/eprint/1490740> .