Sciweavers

15485 search results - page 668 / 3097
» Computing Optimal Subsets
Sort
View
IEEEPACT
1998
IEEE
15 years 11 months ago
A Matrix-Based Approach to the Global Locality Optimization Problem
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
SCCC
1997
IEEE
15 years 11 months ago
Write Optimized Object-Oriented Database Systems
In a database system, read operations are much more common than write operations, and consequently, database systems have been read optimized. As the size of main memory increases...
Kjetil Nørvåg, Kjell Bratbergsengen
SAC
1996
ACM
15 years 11 months ago
An enabling optimization for C++ virtual functions
Gaining the code re-use advantages of object oriented programming requires dynamic function binding, which allows a new subclass to override a function of a superclass. Dynamic bi...
Bradley M. Kuhn, David Binkley
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 11 months ago
Local search for multiobjective function optimization: pareto descent method
Genetic Algorithm (GA) is known as a potent multiobjective optimization method, and the effectiveness of hybridizing it with local search (LS) has recently been reported in the li...
Ken Harada, Jun Sakuma, Shigenobu Kobayashi
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
15 years 11 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