Proceedings of the 12th Annual Conference Companion on Genetic and Evolutionary Computation 2010
DOI: 10.1145/1830761.1830891
|View full text |Cite
|
Sign up to set email alerts
|

Using synthetic test suites to empirically compare search-based and greedy prioritizers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…Conrad et al built a new framework [32] called GELATIONS (GEneticaLgo-rithmbAsed Test suItepriOritizatioN System). Williams and Kapfhammer conducted a study to compare the effectiveness of search based and greedy prioritizers [34]. For large test suites, hill climbing algorithm appeared more efficient than greedy algorithm.…”
Section: Test Case Prioritization -Basics and Related Workmentioning
confidence: 99%
“…Conrad et al built a new framework [32] called GELATIONS (GEneticaLgo-rithmbAsed Test suItepriOritizatioN System). Williams and Kapfhammer conducted a study to compare the effectiveness of search based and greedy prioritizers [34]. For large test suites, hill climbing algorithm appeared more efficient than greedy algorithm.…”
Section: Test Case Prioritization -Basics and Related Workmentioning
confidence: 99%