Sciweavers

505 search results - page 42 / 101
» Optimization of Collective Reduction Operations
Sort
View
ICIP
2003
IEEE
15 years 11 months ago
Efficient frame vector selection based on ordered sets
The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method o...
Tom Ryen, Guido M. Schuster, Aggelos K. Katsaggelo...
ICCAD
2001
IEEE
97views Hardware» more  ICCAD 2001»
15 years 6 months ago
Addressing the Timing Closure Problem by Integrating Logic Optimization and Placement
Timing closure problems occur when timing estimates computed during logic synthesis do not match with timing estimates computed from the layout of the circuit. In such a situation...
Wilsin Gosti, Sunil P. Khatri, Alberto L. Sangiova...
GECCO
2010
Springer
184views Optimization» more  GECCO 2010»
15 years 1 months ago
A mono surrogate for multiobjective optimization
Most surrogate approaches to multi-objective optimization build a surrogate model for each objective. These surrogates can be used inside a classical Evolutionary Multiobjective O...
Ilya Loshchilov, Marc Schoenauer, Michèle S...
PAAPP
2006
141views more  PAAPP 2006»
14 years 9 months ago
Algorithmic optimizations of a conjugate gradient solver on shared memory architectures
OpenMP is an architecture-independent language for programming in the shared memory model. OpenMP is designed to be simple and in terms of programming abstractions. Unfortunately,...
Henrik Löf, Jarmo Rantakokko
SIAMNUM
2010
150views more  SIAMNUM 2010»
14 years 4 months ago
Quasi-Optimal Convergence Rate of an Adaptive Discontinuous Galerkin Method
We analyze an adaptive discontinuous finite element method (ADFEM) for symmetric second order linear elliptic operators. The method is formulated on nonconforming meshes made of si...
Andrea Bonito, Ricardo H. Nochetto