108 search results - page 4 / 22 » Constructing interaction test suites with greedy algorithms |
GECCO
2005
Springer
14 years 29 days ago
2005
Springer
Constructive Induction is the process of transforming the original representation of hard concepts with complex interaction into a representation that highlights regularities. Mos...
WEA
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
EOR
2010
13 years 7 months ago
2010
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
A covering array CA(N; t, k, v) is an N ? k array such that every N ? t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Coverin...
JCO
1998
13 years 7 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...