Sciweavers

2703 search results - page 423 / 541
» Optimizing memory transactions
Sort
View
DAC
1997
ACM
15 years 7 months ago
Wire Segmenting for Improved Buffer Insertion
Buffer insertion seeks to place buffers on the wires of a signal net to minimize delay. Van Ginneken [14] proposed an optimal dynamic programming solution (with extensions propose...
Charles J. Alpert, Anirudh Devgan
ECOOP
2007
Springer
15 years 7 months ago
AS-GC: An Efficient Generational Garbage Collector for Java Application Servers
Abstract. A generational collection strategy utilizing a single nursery cannot efficiently manage objects in application servers due to variance in their lifespans. In this paper, ...
Feng Xian, Witawas Srisa-an, ChengHuan Jia, Hong J...
DATE
2004
IEEE
136views Hardware» more  DATE 2004»
15 years 7 months ago
Compact Binaries with Code Compression in a Software Dynamic Translator
Embedded software is becoming more flexible and adaptable, which presents new challenges for management of highly constrained system resources. Software dynamic translation is a t...
Stacey Shogan, Bruce R. Childers
131
Voted
GECCO
2006
Springer
180views Optimization» more  GECCO 2006»
15 years 7 months ago
Improving cooperative GP ensemble with clustering and pruning for pattern classification
A boosting algorithm based on cellular genetic programming to build an ensemble of predictors is proposed. The method evolves a population of trees for a fixed number of rounds an...
Gianluigi Folino, Clara Pizzuti, Giandomenico Spez...
GECCO
2006
Springer
141views Optimization» more  GECCO 2006»
15 years 7 months ago
Coevolution of neural networks using a layered pareto archive
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
German A. Monroy, Kenneth O. Stanley, Risto Miikku...