Recommendation Systems in Software Engineering 2013
DOI: 10.1007/978-3-642-45135-5_19
|View full text |Cite
|
Sign up to set email alerts
|
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
19
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 22 publications
(19 citation statements)
references
References 25 publications
0
19
0
Order By: Relevance
“…In addition to Chen et al's approach, Mazo et al [9] proposes the following heuristics for ordering configuration questions: it also works when a variable has several values on its domain but only one is valid". In ascending order of computational cost and descending order of constraint propagation capacity, Mazo et al [9] summarize three approaches to implement Heuristic 4 when the configuration model is encoded as a predicate logic formula: (i) forward-checking; (ii) partial look-ahead; and (iii) full look-ahead (i.e., whereas forward-checking is the fastest algorithm, but produces the most limited form of constraint propagation during search, full look-ahead is the most expensive approach, but gets the best results).…”
Section: Pr(c) =mentioning
confidence: 99%
See 4 more Smart Citations
“…In addition to Chen et al's approach, Mazo et al [9] proposes the following heuristics for ordering configuration questions: it also works when a variable has several values on its domain but only one is valid". In ascending order of computational cost and descending order of constraint propagation capacity, Mazo et al [9] summarize three approaches to implement Heuristic 4 when the configuration model is encoded as a predicate logic formula: (i) forward-checking; (ii) partial look-ahead; and (iii) full look-ahead (i.e., whereas forward-checking is the fastest algorithm, but produces the most limited form of constraint propagation during search, full look-ahead is the most expensive approach, but gets the best results).…”
Section: Pr(c) =mentioning
confidence: 99%
“…In ascending order of computational cost and descending order of constraint propagation capacity, Mazo et al [9] summarize three approaches to implement Heuristic 4 when the configuration model is encoded as a predicate logic formula: (i) forward-checking; (ii) partial look-ahead; and (iii) full look-ahead (i.e., whereas forward-checking is the fastest algorithm, but produces the most limited form of constraint propagation during search, full look-ahead is the most expensive approach, but gets the best results). In our paper, configuration models are encoded as propositional logic formulas, where a full constraint propagation is computationally feasible.…”
Section: Pr(c) =mentioning
confidence: 99%
See 3 more Smart Citations