Self-adaptive Systems: Facilitating the Use of Combinatorial Problem Solvers

Crawford B.; Soto R.; Monfroy E.; Johnson F.

dc.contributor.author	Crawford B.
dc.contributor.author	Soto R.
dc.contributor.author	Monfroy E.
dc.contributor.author	Johnson F.
dc.date.accessioned	2020-09-02T22:15:41Z
dc.date.available	2020-09-02T22:15:41Z
dc.date.issued	2014
dc.identifier	10.1007/978-3-319-07857-1_88
dc.identifier.citation	434 PART I, , 503-508
dc.identifier.issn	18650929
dc.identifier.uri	https://hdl.handle.net/20.500.12728/4154
dc.description	New methods in Combinatorial Problem Solving can solve larger problems in different domains. They also became more complex, which means that they are hard to use and fine-tuning to the peculiarities of a given problem, limiting its use to a small set of experts, and instead black-box solvers with automated search procedure are needed for its broad applicability. Autonomous Search Systems represent a new research field defined to precisely address the above challenge. The main goal of this paper is to review recent works on this kind of Self-adaptive Systems from the standpoint of the actual requirement for solvers. © Springer International Publishing Switzerland 2014.
dc.language.iso	en
dc.publisher	Springer Verlag
dc.subject	Autonomous Search Systems
dc.subject	Combinatorial Problem Solvers
dc.subject	Self-adaptive Systems
dc.subject	Safety devices
dc.subject	Automated searches
dc.subject	Autonomous searches
dc.subject	Black boxes
dc.subject	Combinatorial problem
dc.subject	Different domains
dc.subject	Research fields
dc.subject	Self-adaptive system
dc.subject	Adaptive systems
dc.title	Self-adaptive Systems: Facilitating the Use of Combinatorial Problem Solvers
dc.type	Conference Paper