Sciweavers

1725 search results - page 171 / 345
» Relaxed genetic programming
Sort
View
TOOLS
2000
IEEE
15 years 2 months ago
Testing-for-Trust: The Genetic Selection Model Applied to Component Qualification
This paper presents a method and a tool for building trustable OO components. The methodology is based on an integrated design and test approach for OO software components. It is ...
Benoit Baudry, Vu Le Hanh, Yves Le Traon
KBSE
1997
IEEE
15 years 2 months ago
Genetic Algorithms for Dynamic Test Data Generation
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
Christoph C. Michael, Gary McGraw, Michael Schatz,...
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 2 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 2 months ago
Genetic evolution of hierarchical behavior structures
The development of coherent and dynamic behaviors for mobile robots is an exceedingly complex endeavor ruled by task objectives, environmental dynamics and the interactions within...
Brian G. Woolley, Gilbert L. Peterson
NLP
2000
15 years 2 months ago
Enhancing Preference-Based Anaphora Resolution with Genetic Algorithms
Abstract. The paper argues that a promising way to improve the success rate of preference-based anaphora resolution algorithms is the use of machine learning. The paper outlines MA...
Constantin Orasan, Richard Evans, Ruslan Mitkov