Sciweavers

3206 search results - page 57 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
141
Voted
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 8 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
ICESS
2007
Springer
15 years 8 months ago
Intra Routing Protocol with Hierarchical and Distributed Caching in Nested Mobile Networks
Abstract. We propose a novel route optimization protocol for intraNEMO communication using a hierarchical and distributed caching scheme. The proposed scheme employs the routing ca...
Hyemee Park, Moonseong Kim, Hyunseung Choo
IPPS
1998
IEEE
15 years 6 months ago
Memory Hierarchy Management for Iterative Graph Structures
The increasing gap in processor and memory speeds has forced microprocessors to rely on deep cache hierarchies to keep the processors from starving for data. For many applications...
Ibraheem Al-Furaih, Sanjay Ranka
102
Voted
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
15 years 8 months ago
Investigating the performance of module acquisition in cartesian genetic programming
Embedded Cartesian Genetic Programming (ECGP) is a form of the graph based Cartesian Genetic Programming (CGP) in which modules are automatically acquired and evolved. In this pap...
James Alfred Walker, Julian Francis Miller
FOCS
2008
IEEE
15 years 8 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak