Sciweavers

281 search results - page 17 / 57
» heuristics 2000
Sort
View
EUROMICRO
2000
IEEE
14 years 2 months ago
Task Assignment and Scheduling under Memory Constraints
Many DSP and image processing embedded systems have hard memory constraints which makes it difficult to find a good task assignment and scheduling which fulfill these constrain...
Radoslaw Szymanek, Krzysztof Kuchcinski
ICPP
2000
IEEE
14 years 2 months ago
Matrix-Matrix Multiplication on Heterogeneous Platforms
In this paper, we address the issue of implementing matrix-matrix multiplication on heterogeneous platforms. We target two different classes of heterogeneous computing resources: ...
Olivier Beaumont, Vincent Boudet, Fabrice Rastello...
CHI
2000
ACM
14 years 2 months ago
Using naming time to evaluate quality predictors for model simplification
Model simplification researchers require quality heuristics to guide simplification, and quality predictors to allow comparison of different simplification algorithms. However, th...
Benjamin Watson, Alinda Friedman, Aaron McGaffey
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
14 years 1 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa
ICS
2000
Tsinghua U.
14 years 1 months ago
Fast greedy weighted fusion
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
Ken Kennedy