Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10945Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Likas, A. | en |
| dc.contributor.author | Kontoravdis, D. | en |
| dc.contributor.author | Stafylopatis, A. | en |
| dc.date.accessioned | 2015-11-24T17:01:34Z | - |
| dc.date.available | 2015-11-24T17:01:34Z | - |
| dc.identifier.issn | 0941-0643 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10945 | - |
| dc.rights | Default Licence | - |
| dc.subject | constraint satisfaction | en |
| dc.subject | discrete optimization | en |
| dc.subject | graph partitioning | en |
| dc.subject | higher-order hopfield | en |
| dc.subject | reinforcement learning | en |
| dc.subject | set partitioning | en |
| dc.subject | networks | en |
| dc.title | Discrete Optimization-Based on the Combined Use of Reinforcement and Constraint Satisfaction Schemes | 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 | 1995 | - |
| heal.abstract | A new approach is presented for finding near-optimal solutions to discrete optimisation problems that is based on the cooperation of two modules: an optimisation module and a constraint satisfaction module, The optimisation module must be able to search the problem state space through an iterative process of sampling and evaluating the generated samples. To evaluate a generated point, first a constraint satisfaction module is employed to map that point to another one satisfying the problem constraints, and then the cost of the new point is used as the evaluation of the original one, The scheme that we have adopted for testing the effectiveness of the method uses a reinforcement learning algorithm in the optimisation module and a general deterministic constraint satisfaction algorithm in the constraint satisfaction module. Experiments using this scheme for the solution of two optimisation problems indicate that the proposed approach is very effective in providing feasible solutions of acceptable quality. | en |
| heal.journalName | Neural Computing & Applications | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Likas-1995-Discrete Optimization-Based on the Combined Use of Reinforcement and Constraint Satisfaction Schemes.pdf | 1.13 MB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
