𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A neural network approach to tiling problems

✍ Scribed by T. Tambouratzis

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
123 KB
Volume
16
Category
Article
ISSN
0884-8173

No coin nor oath required. For personal study only.

✦ Synopsis

The family of tiling problems comprises combinatorial optimization problems involving a grid and a number of shapes. Appropriate placements of the shapes on the grid are sought such that specific constraints concerning shape overlap and grid coverage are satisfied. The family of tiling problems has links with graph theory and is, thus, interesting from a theoretical point of view. Being related to VLSI circuit design, tiling problems are also of practical importance. In this piece of research, parallel implementations of representative tiling problems are proposed by employing three distinct harmony theory-based artificial neural networks. Optimal solutions are always produced for appropriately selected values of the network parameters. Problem complexity has been found to affect the computational complexity of the solution.

πŸ“œ SIMILAR VOLUMES

Neural network approach to the ECM probl
Neural network approach to the ECM problem
✍ Keniti Gonoi; Takakazu Kurokawa πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 128 KB πŸ‘ 2 views
A unified approach to network location p
A unified approach to network location problems
✍ Nickel, Stefan; Puerto, Justo πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 124 KB πŸ‘ 2 views

In this paper, we introduce a new type of single-facility location problem on networks which includes as special cases most of the classical criteria in the literature. Structural results as well as a finite dominating set for the optimal locations are developed. Also, the extension to the multifaci