Taj-ul Islam

Abstract

Neural network architectures are effectively applied to solve the channel routing problem. Algorithms for both two-layer and multilayer channel-width minimization, and constrained via minimization are proposed and implemented. Experimental results show that the proposed channel-width minimization algorithms are much superior in all respects compared to existing algorithms. The optimal two-layer solutions to most of the benchmark problems, not previously obtained, are obtained for the first time, including an optimal solution to the famous Deutch's difficult problem. The optimal solution in four-layers for one of the be lchmark problems, not previously obtained, is obtained for the first time. Both convergence rate and the speed with which the simulations are executed are outstanding. A neural network solution to the constrained via minimization problem is also presented. In addition, a fast and simple linear-time algorithm is presented, possibly for the first time, for coloring of vertices of an interval graph, provided the line intervals are given.

Library of Congress Subject Headings

Telecommunication--Switching systems--Data processing; Neural networks (Computer science)--Programming; Algorithms

Publication Date

8-1-1993

Document Type

Thesis

Department, Program, or Center

Computer Engineering (KGCOE)

Advisor

Anderson, Peter

Advisor/Committee Member

Czernikowski, Roy

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: TK5103.8.I84 1993

Campus

RIT – Main Campus

Download

Share

COinS