388 search results - page 34 / 78 » Guiding random test generation with program analysis |
88
Voted
COCO
2005
Springer
15 years 6 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
124
click to vote
KDD
2008
ACM
16 years 25 days ago
2008
ACM
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
113
Voted
LOPSTR
2004
Springer
15 years 5 months ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
102
click to vote
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
This study reports the work to date on the analysis of different methodologies for constant creation with the aim of applying the most advantageous method to the dynamic real wor...
101
Voted
GPEM
2000
15 years 7 days ago
2000
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...