Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/11110
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Likas, A. | en |
dc.contributor.author | Papageorgiou, G. | en |
dc.contributor.author | Stafylopatis, A. | en |
dc.date.accessioned | 2015-11-24T17:02:55Z | - |
dc.date.available | 2015-11-24T17:02:55Z | - |
dc.identifier.issn | 0924-669X | - |
dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/11110 | - |
dc.rights | Default Licence | - |
dc.subject | constraint satisfaction | en |
dc.subject | neural network architectures | en |
dc.subject | hopfield network | en |
dc.subject | boltzmann machine | en |
dc.subject | frequency assignment problem | en |
dc.subject | neural networks | en |
dc.subject | channel assignment | en |
dc.subject | optimization problems | en |
dc.subject | architecture | en |
dc.subject | algorithm | en |
dc.title | A connectionist approach for solving large constraint satisfaction problems | en |
heal.type | journalArticle | - |
heal.type.en | Journal article | en |
heal.type.el | Άρθρο Περιοδικού | el |
heal.language | en | - |
heal.access | campus | - |
heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
heal.publicationDate | 1997 | - |
heal.abstract | An 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.journalName | Applied Intelligence | en |
heal.journalType | peer reviewed | - |
heal.fullTextAvailability | TRUE | - |
Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Likas-1997-A connectionist approach for solving large constraint satisfaction problems.pdf | 237.29 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License