Metaheuristic-based heuristics for symmetric-matrix bandwidth reduction: a systematic review
Computational and storage costs of resolution of large sparse linear systems Ax= b can be
performed by reducing the bandwidth of A. Bandwidth reduction consists of carrying out …
performed by reducing the bandwidth of A. Bandwidth reduction consists of carrying out …
[كتاب][B] Advances in bio-inspired computing for combinatorial optimization problems
CM Pintea - 2014 - Springer
” Advances in Bio-inspired Combinatorial Optimization Problems” illustrates several recent
bio-inspired efficient algorithms for solving NP-hard problems. Theoretical bio-inspired …
bio-inspired efficient algorithms for solving NP-hard problems. Theoretical bio-inspired …
Adaptation of deep convolutional neural networks for cancer grading from histopathological images
The paper addresses the medical challenge of interpreting histopathological slides through
expert-independent automated learning with implicit feature determination and direct …
expert-independent automated learning with implicit feature determination and direct …
The bandwidths of a matrix. a survey of algorithms
The bandwidth, average bandwidth, envelope, profile and antibandwidth of the matrices
have been the subjects of study for at least 45 years. These problems have generated …
have been the subjects of study for at least 45 years. These problems have generated …
An evaluation of heuristic methods for the bandwidth reduction of large-scale graphs
This paper studies the bandwidth reduction problem for large-scale sparse matrices in serial
computations. A heuristic for bandwidth reduction reorders the rows and columns of a given …
computations. A heuristic for bandwidth reduction reorders the rows and columns of a given …
Iterated Local Search with Tabu Search for the Bandwidth Reduction Problem in Graphs
This paper addresses the bandwidth reduction problem in graphs, which is relevant in
several applications, such as reducing memory consumption and computational cost in …
several applications, such as reducing memory consumption and computational cost in …
In search of the optimal set of indicators when classifying histopathological images
There is currently a large amount of histopathological images due to the intensive
prevention screening programs worldwide. This fact overloads the pathologists' tasks …
prevention screening programs worldwide. This fact overloads the pathologists' tasks …
On the solution of the graph bandwidth problem by means of search methods
Abstract The Graph Bandwidth Problem is a well-known and important graph layout problem
with a large number of applications in scientific and engineering fields. The problem is …
with a large number of applications in scientific and engineering fields. The problem is …
Two-dimensional bandwidth minimization problem: Exact and heuristic approaches
Reducing the bandwidth in a graph is an optimization problem which has generated
significant attention over time due to its practical application in Very Large Scale Integration …
significant attention over time due to its practical application in Very Large Scale Integration …
Optimization of Quantum Systems Emulation via a Variant of the Bandwidth Minimization Problem
This paper introduces weighted-BMP, a variant of the Bandwidth Minimization Problem
(BMP), with a significant application in optimizing quantum emulation. Weighted-BMP …
(BMP), with a significant application in optimizing quantum emulation. Weighted-BMP …