The STUDIA UNIVERSITATIS BABE┼×-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 4 / 2010  
         
  Article:   A REINFORCEMENT LEARNING APPROACH FOR SOLVING THE MATRIX BANDWIDTH MINIMIZATION PROBLEM.

Authors:  GABRIELA CZIBULA, ISTVAN GERGELY CZIBULA, CAMELIA-MIHAELA PINTEA.
 
       
         
  Abstract:  

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 order to keep its nonzero elements in a band lying as close as possible to the main diagonal. The MBMP has been found to be relevant to a wide range of applications including circuit design, network survivability, data storage and information retrieval. The potential of the reinforcement learning model proposed for solving the MBMP was confirmed by the computational experiment, which has provided encouraging results.

 

Key words and phrases. Combinatorial optimization, Matrix Bandwidth Minimization, Problem, Reinforcement Learning.

 
         
     
         
         
      Back to previous page