699 search results - page 106 / 140 » The method of combinatorial telescoping |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Algorithms for the construction of software interaction test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing test suite...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
STACS
2007
Springer
14 years 2 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
VLDB
2007
ACM
14 years 2 months ago
2007
ACM
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...