Fourth International Conference on Hybrid Intelligent Systems (HIS'04) Q'tron Neural Networks for Constraint Satisfaction Kitakyushu, Japan December 05-December 08 ISBN: 0-7695-2291-2
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICHIS.2004.77
This paper proposes the methods to solve the constraint satisfaction problems (CSPs) using Q'tron neural networks (NNs). A Q'tron NN is local-minima free if it is built as a known-energy system and is incorporated with the proposed persistent noise-injection mechanism. The so-built Q'tron NN, as a result, will settle down if and only if a feasible solution is found. Additionally, such a Q'tron NN is intrinsically auto-reversible. This renders the NN operable in a question-answering mode for extracting interested information. A concrete example, i.e., to solve the N-queen problem, will be demonstrated to highlight the main concept.
Citation:
Tai-Wen Yue, Mei-Ching Chen, "Q'tron Neural Networks for Constraint Satisfaction," his, pp.398-403, Fourth International Conference on Hybrid Intelligent Systems (HIS'04), 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||