Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLikas, A.en
dc.contributor.authorPapageorgiou, G.en
dc.contributor.authorStafylopatis, A.en
dc.rightsDefault Licence-
dc.subjectconstraint satisfactionen
dc.subjectneural network architecturesen
dc.subjecthopfield networken
dc.subjectboltzmann machineen
dc.subjectfrequency assignment problemen
dc.subjectneural networksen
dc.subjectchannel assignmenten
dc.subjectoptimization problemsen
dc.titleA connectionist approach for solving large constraint satisfaction problemsen
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.abstractAn efficient neural network technique is presented for the solution of binary constraint satisfaction problems. The method is based on the application of a double-update technique to the operation of the discrete Hopfield-type neural network that can be constructed for the solution of such problems. This operation scheme ensures that the network moves only between consistent states, such that each problem variable is assigned exactly one value, and leads to a fast and efficient search of the problem state space. Extensions of the proposed method are considered in order to include several optimisation criteria in the search. Experimental results concerning many real-size instances of the Radio Links Frequency Assignment Problem demonstrate very good performance.en
heal.journalNameApplied Intelligenceen
heal.journalTypepeer reviewed-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

This item is licensed under a Creative Commons License Creative Commons