Sciweavers

3052 search results - page 556 / 611
» A community-aware search engine
Sort
View
FSTTCS
2007
Springer
16 years 15 days ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
GECCO
2007
Springer
130views Optimization» more  GECCO 2007»
16 years 15 days ago
Variable discrimination of crossover versus mutation using parameterized modular structure
Recent work has provided functions that can be used to prove a principled distinction between the capabilities of mutation-based and crossover-based algorithms. However, prior fun...
Rob Mills, Richard A. Watson
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
16 years 15 days ago
Search-based testing of service level agreements
The diffusion of service oriented architectures introduces the need for novel testing approaches. On the one side, testing must be able to identify failures in the functionality ...
Massimiliano Di Penta, Gerardo Canfora, Gianpiero ...
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
16 years 15 days ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna
GECCO
2007
Springer
276views Optimization» more  GECCO 2007»
16 years 15 days ago
Automatic mutation test input data generation via ant colony
Fault-based testing is often advocated to overcome limitations of other testing approaches; however it is also recognized as being expensive. On the other hand, evolutionary algor...
Kamel Ayari, Salah Bouktif, Giuliano Antoniol