Sciweavers

1972 search results - page 118 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
POPL
1998
ACM
14 years 1 months ago
Maximal Static Expansion
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
Denis Barthou, Albert Cohen, Jean-Francois Collard
ISSTA
2009
ACM
14 years 3 months ago
SideTrack: generalizing dynamic atomicity analysis
Atomicity is a key correctness specification for multithreaded programs. Prior dynamic atomicity analyses include precise tools, which report an error if and only if the observed...
Jaeheon Yi, Caitlin Sadowski, Cormac Flanagan
IJIT
2004
13 years 10 months ago
Parallezation Protein Sequence Similarity Algorithms using Remote Method Interface
One of the major problems in genomic field is to perform sequence comparison on DNA and protein sequences. Executing sequence comparison on the DNA and protein data is a computatio...
Mubarak Saif Mohsen, Zurinahni Zainol, Rosalina Ab...
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
14 years 1 months ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
14 years 1 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule