204 search results - page 4 / 41 » Parameterizations of Test Cover with Bounded Test Sizes |
COCO
2004
Springer
15 years 2 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
118
click to vote
ICSM
2009
IEEE
15 years 5 months ago
2009
IEEE
Most of today’s event driven software (EDS) systems are tested using test cases that are carefully constructed as sequences of events; they test the execution of an event in the...
COCOON
2006
Springer
15 years 2 months ago
2006
Springer
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
ICSM
2005
IEEE
15 years 4 months ago
2005
IEEE
Software testing is a critical part of software development. Test suite sizes may grow significantly with subsequent modifications to the software over time. Due to time and res...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...