Sciweavers

18 search results - page 1 / 4
» Heuristics for matrix bandwidth reduction
Sort
View
EOR
2006
70views more  EOR 2006»
13 years 4 months ago
Heuristics for matrix bandwidth reduction
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experime...
Andrew Lim, Brian Rodrigues, Fei Xiao
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
13 years 10 months ago
Integrated Genetic Algorithm with Hill Climbing for Bandwidth Minimization Problem
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and ...
Andrew Lim, Brian Rodrigues, Fei Xiao
ICASSP
2010
IEEE
13 years 5 months ago
A nullspace analysis of the nuclear norm heuristic for rank minimization
The problem of minimizing the rank of a matrix subject to linear equality constraints arises in applications in machine learning, dimensionality reduction, and control theory, and...
Krishnamurthy Dvijotham, Maryam Fazel
TPDS
2010
174views more  TPDS 2010»
13 years 3 months ago
Parallel Two-Sided Matrix Reduction to Band Bidiagonal Form on Multicore Architectures
The objective of this paper is to extend, in the context of multicore architectures, the concepts of tile algorithms [Buttari et al., 2007] for Cholesky, LU, QR factorizations to t...
Hatem Ltaief, Jakub Kurzak, Jack Dongarra
GLOBECOM
2010
IEEE
13 years 2 months ago
Routing and Spectrum Allocation in OFDM-Based Optical Networks with Elastic Bandwidth Allocation
Orthogonal Frequency Division Multiplexing (OFDM) has been recently proposed as a modulation technique for optical networks, due to its good spectral efficiency and impairment tole...
Kostas Christodoulopoulos, Ioannis Tomkos, Emmanou...