Automated, adaptive, and optimized search for CSPs via cuckoo search

Vista sencilla de ítem
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorFlores J.es_ES
dc.contributor.authorMella F.es_ES
dc.contributor.authorGalleguillos, C.es_ES
dc.contributor.authorJohnson, F.es_ES
dc.contributor.authorParedes, F.es_ES
dc.date.accessioned6/22/2022 14:20
dc.date.accessioned2022-06-22T20:03:32Z
dc.date.available6/22/2022 14:20
dc.date.available2022-06-22T20:03:32Z
dc.date.issued2015
dc.description.abstractConstraint Programing is a programming paradigm devoted to the efficient solving of constraint satisfaction problems (CSPs). A CSP is a formal problem representation mainly composed of variables and constraints defining relations among those variables. The resolution process of CSPs is commonly carried out by building and exploring a search tree that holds the possibles solutions. Such a tree is dynamically created by interleaving two different phases: enumeration and propagation. During enumeration, the variables and values are chosen to build the possible solution, while propagation intend to delete the values having no chance to reach a feasible result. Autonomous Search is a new technique that gives the ability to the resolution process to be adaptive by re-configuring its enumeration strategy when poor performances are detected. This technique has exhibited impressive results during the last years. However, such a re-configuration is hard to achieve as parameters are problem-dependent and their best configuration is not stable along the search. In this paper, we introduce an Autonomous Search framework that incorporates a new optimizer based on Cuckoo Search able to efficiently support the re-configuration phase. Our goal is to provide an automated, adaptive, and optimized search system for CSPs. We report encouraging results where our approach clearly improves the performance of previously reported Autonomous Search approaches for CSPs. © Springer International Publishing Switzerland 2015.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1007/978-3-319-20466-6_46es_ES
dc.identifier.urihttps://doi.org/10.1007/978-3-319-20466-6_46
dc.language.isoen_USes_ES
dc.publisherSpringer Verlages_ES
dc.publisher.countryDEes_ES
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)es_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)es_ES
dc.subjectComputer Sciencees_ES
dc.subjectMathematicses_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#2.02.04es_ES
dc.titleAutomated, adaptive, and optimized search for CSPs via cuckoo searches_ES
dc.typeinfo:eu-repo/semantics/conferenceObjectes_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
26. Automated, adaptive, and optimized search for CSPs via cuckoo search.pdf
Tamaño:
304.74 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso