没收
发表于 2025-3-25 05:09:08
Conference proceedings 2015challenge track papers were carefully reviewed and selected from 51 submissions. Search Based Software Engineering (SBSE) studies the application of meta-heuristic optimization techniques to various software engineering problems, ranging from requirements engineering to software testing and maintenance..
ANTI
发表于 2025-3-25 08:23:24
0302-9743Engineering, SSBSE 2015, held in Bergamo, Italy, in September 2015. .The 12 revised full papers presented together with 2 invited talks, 4 short papers, 2 papers of the graduate track, and 13 challenge track papers were carefully reviewed and selected from 51 submissions. Search Based Software Engi
Microaneurysm
发表于 2025-3-25 15:03:33
http://reply.papertrans.cn/87/8631/863052/863052_23.png
jovial
发表于 2025-3-25 17:39:30
Optimizing Aspect-Oriented Product Line Architectures with Search-Based Algorithmslve this problem, this paper introduces a more adequate representation for AOPLAs and a set of search operators, called SO4ASPAR (Search Operators for Aspect-Oriented Architectures). Results from an empirical evaluation show that the proposed operators yield better solutions regarding the fitness values, besides preserving the AOM rules.
尖
发表于 2025-3-25 22:33:19
http://reply.papertrans.cn/87/8631/863052/863052_25.png
闹剧
发表于 2025-3-26 02:06:47
http://reply.papertrans.cn/87/8631/863052/863052_26.png
Ancillary
发表于 2025-3-26 07:08:37
http://reply.papertrans.cn/87/8631/863052/863052_27.png
deficiency
发表于 2025-3-26 09:00:15
Epistatic Genetic Algorithm for Test Case Prioritizationnalyzed, where Epistatic Test Case Segment is defined. Two associated crossover operators are proposed based on epistasis. The empirical studies show that the proposed two-point crossover operator, E-Ord, outperform the crossover PMX, and can produce higher fitness with a faster convergence.
平息
发表于 2025-3-26 13:43:28
http://reply.papertrans.cn/87/8631/863052/863052_29.png
杀死
发表于 2025-3-26 18:29:36
Hypervolume-Based Search for Test Case Prioritizationria. The results shows that HGA is more cost-effective than the additional greedy algorithm on large systems and on average requires 36 % of the execution time required by the additional greedy algorithm.