A Reinforcement Learning Approach for Solving the Matrix Bandwidth Minimization Problem
In this paper we aim at investigating and experimentally evaluating the reinforcement learning based model that we have previously introduced to solve the well-known matrix bandwidth minimization problem (MBMP). The MBMP is an NP-complete problem, which is to permute rows and columns of a matrix in...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Babes-Bolyai University, Cluj-Napoca
2010-12-01
|
Series: | Studia Universitatis Babes-Bolyai: Series Informatica |
Online Access: | http://www.cs.ubbcluj.ro/apps/reviste/index.php/studia-i/article/view/2 |