Sciweavers

388 search results - page 34 / 78
» Guiding random test generation with program analysis
Sort
View
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
14 years 2 months ago
More on Noncommutative Polynomial Identity Testing
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...
Andrej Bogdanov, Hoeteck Wee
KDD
2008
ACM
134views Data Mining» more  KDD 2008»
14 years 9 months ago
Privacy-preserving cox regression for survival analysis
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...
Shipeng Yu, Glenn Fung, Rómer Rosales, Srir...
LOPSTR
2004
Springer
14 years 2 months ago
Determinacy Analysis for Logic Programs Using Mode and Type Information
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 (...
Pedro López-García, Francisco Bueno,...
GECCO
2005
Springer
137views Optimization» more  GECCO 2005»
14 years 2 months ago
Constant generation for the financial domain using grammatical evolution
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...
Ian Dempsey
GPEM
2000
103views more  GPEM 2000»
13 years 8 months ago
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
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...
William B. Langdon