Sciweavers

3750 search results - page 718 / 750
» Code Optimization for Code Compression
Sort
View
SIGCOMM
2005
ACM
15 years 7 months ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...
VEE
2005
ACM
199views Virtualization» more  VEE 2005»
15 years 7 months ago
Escape analysis in the context of dynamic compilation and deoptimization
In object-oriented programming languages, an object is said to escape the method or thread in which it was created if it can also be accessed by other methods or threads. Knowing ...
Thomas Kotzmann, Hanspeter Mössenböck
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
15 years 7 months ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
15 years 7 months ago
Using evolutionary algorithms for the unit testing of object-oriented software
As the paradigm of object orientation becomes more and more important for modern IT development projects, the demand for an automated test case generation to dynamically test obje...
Stefan Wappler, Frank Lammermann
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
15 years 7 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader