Sciweavers

133 search results - page 9 / 27
» Memory with memory: soft assignment in genetic programming
Sort
View
IWMM
2004
Springer
127views Hardware» more  IWMM 2004»
14 years 25 days ago
Garbage-first garbage collection
Garbage-First is a server-style garbage collector, targeted for multi-processors with large memories, that meets a soft real-time goal with high probability, while achieving high ...
David Detlefs, Christine H. Flood, Steve Heller, T...
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
14 years 2 months ago
Why evolution is not a good paradigm for program induction: a critique of genetic programming
We revisit the roots of Genetic Programming (i.e. Natural Evolution), and conclude that the mechanisms of the process of evolution (i.e. selection, inheritance and variation) are ...
John R. Woodward, Ruibin Bai
EUROGP
2006
Springer
112views Optimization» more  EUROGP 2006»
13 years 11 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
NIPS
1996
13 years 8 months ago
Predicting Lifetimes in Dynamically Allocated Memory
Predictions oflifetimesofdynamicallyallocated objects can be used to improve time and space e ciency of dynamic memory management in computer programs. Barrett and Zorn 1993] used...
David A. Cohn, Satinder P. Singh
CC
2004
Springer
14 years 26 days ago
Using Multiple Memory Access Instructions for Reducing Code Size
An important issue in embedded systems design is the size of programs. As computing devices decrease in size, yet with more and more functions, better code size optimizations are i...
Neil Johnson, Alan Mycroft