2013 1st International Workshop on Combining Modelling and Search-Based Software Engineering (CMSBSE) 2013
DOI: 10.1109/cmsbse.2013.6604435
|View full text |Cite
|
Sign up to set email alerts
|

Metrics on feature models to optimize configuration adaptation at run time

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
17
0
1

Year Published

2014
2014
2019
2019

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 8 publications
(19 citation statements)
references
References 4 publications
0
17
0
1
Order By: Relevance
“…Finally, although an optimal solution is not mandatory, it is desirable to compute "good-enough" solutions. The proposed Configuration Selection Algorithm (Sanchez et al 2013) meets these requirements.…”
Section: Optimizationmentioning
confidence: 92%
See 4 more Smart Citations
“…Finally, although an optimal solution is not mandatory, it is desirable to compute "good-enough" solutions. The proposed Configuration Selection Algorithm (Sanchez et al 2013) meets these requirements.…”
Section: Optimizationmentioning
confidence: 92%
“…This optimization algorithm is based on the Best-First Search schema (Pearl 1984), a well studied technique for combinatorial optimization problems such as configuration selection on feature models. This algorithm offers a set of proven characteristics with respect to correctness, completeness, efficiency, and optimality that meet the requirements for its application on runtime systems (Sanchez et al 2013). …”
Section: Approach: Feature Models For Runtime Adaptationmentioning
confidence: 99%
See 3 more Smart Citations