Sciweavers

1725 search results - page 224 / 345
» Relaxed genetic programming
Sort
View
ICSM
2006
IEEE
15 years 4 months ago
Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding
One approach to supporting program comprehension involves binding concepts to source code. Previously proposed approaches to concept binding have enforced nonoverlapping boundarie...
Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahda...
ENTCS
2006
113views more  ENTCS 2006»
14 years 10 months ago
Concurrent Java Test Generation as a Search Problem
A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives ...
Yaniv Eytani
CCS
2009
ACM
15 years 4 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»
15 years 2 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...
BMCBI
2002
109views more  BMCBI 2002»
14 years 9 months ago
Kangaroo - A pattern-matching program for biological sequences
Background: Biologists are often interested in performing a simple database search to identify proteins or genes that contain a well-defined sequence pattern. Many databases do no...
Doron Betel, Christopher W. V. Hogue