Loading…
A neural based approach of contraints satisfaction problem
This paper shows that any constraint satisfaction problem can be solved by a neural network which can be designed by using the problem representation by a constraint programming language. An example of such a transformation is given for the tasks assignment problem. At last we present a method which...
Saved in:
Main Authors: | , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This paper shows that any constraint satisfaction problem can be solved by a neural network which can be designed by using the problem representation by a constraint programming language. An example of such a transformation is given for the tasks assignment problem. At last we present a method which enables us to reduce the number of needed units by splitting the problem into two subproblems. |
---|