Sciweavers

1129 search results - page 133 / 226
» Instruction-Matrix-Based Genetic Programming
Sort
View
CCS
2009
ACM
14 years 5 months ago
Privacy-preserving genomic computation through program specialization
In this paper, we present a new approach to performing important classes of genomic computations (e.g., search for homologous genes) that makes a significant step towards privacy...
Rui Wang, XiaoFeng Wang, Zhou Li, Haixu Tang, Mich...
GECCO
2010
Springer
172views Optimization» more  GECCO 2010»
14 years 3 months ago
Designing better fitness functions for automated program repair
Evolutionary methods have been used to repair programs automatically, with promising results. However, the fitness function used to achieve these results was based on a few simpl...
Ethan Fast, Claire Le Goues, Stephanie Forrest, We...
RTA
2007
Springer
14 years 4 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...
ISSTA
2009
ACM
14 years 4 months ago
Time-aware test-case prioritization using integer linear programming
Techniques for test-case prioritization re-order test cases to increase their rate of fault detection. When there is a fixed time budget that does not allow the execution of all ...
Lu Zhang, Shan-Shan Hou, Chao Guo, Tao Xie, Hong M...
EUROGP
2006
Springer
112views Optimization» more  EUROGP 2006»
14 years 2 months ago
The Halting Probability in Von Neumann Architectures
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...
William B. Langdon, Riccardo Poli