Sciweavers

166 search results - page 27 / 34
» Fixed-parameter evolutionary algorithms and the vertex cover...
Sort
View
EVOW
2009
Springer
15 years 4 months ago
Improving Performance in Combinatorial Optimisation Using Averaging and Clustering
In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was sh...
Mohamed Qasem, Adam Prügel-Bennett
GECCO
2005
Springer
163views Optimization» more  GECCO 2005»
15 years 3 months ago
Benefits of software measures for evolutionary white-box testing
White-box testing is an important method for the early detection of errors during software development. In this process test case generation plays a crucial role, defining appropr...
Frank Lammermann, Stefan Wappler
TAMC
2007
Springer
15 years 3 months ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley
EVOW
2007
Springer
15 years 1 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
GECCO
2007
Springer
234views Optimization» more  GECCO 2007»
15 years 3 months ago
Applying particle swarm optimization to software testing
Evolutionary structural testing is an approach to automatically generating test cases that achieve high structural code coverage. It typically uses genetic algorithms (GAs) to sea...
Andreas Windisch, Stefan Wappler, Joachim Wegener