๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Artificial neural networks for four-coloring map problems and K -colorability problems

โœ Scribed by Takefuji, Y.; Lee, K.C.

Book ID
114559502
Publisher
IEEE
Year
1991
Weight
720 KB
Volume
38
Category
Article
ISSN
0098-4094

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Neural network-based heuristic algorithm
Neural network-based heuristic algorithms for hypergraph coloring problems with applications
โœ Dmitri Kaznachey; Arun Jagota; Sajal Das ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 283 KB

The graph coloring problem is a classic one in combinatorial optimization with a diverse set of significant applications in science and engineering. In this paper, we study several versions of this problem generalized to hypergraphs and develop solutions based on the neural network approach. We expe

An automatic mesh generator for handling
An automatic mesh generator for handling small features in open boundary power transmission line problems using artificial neural networks
โœ Triantafyllidis, D. G. ;Labridis, D. P. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 348 KB ๐Ÿ‘ 2 views

An arti"cial neural network (ANN) has been trained to automatically predict the mesh density vector of open-boundary faulted power transmission line problems under the presence of small features, such as conductors. In order to produce the data for the training database of the ANN a technique for re