{"title":"求解约束满足问题的神经网络方法","authors":"S. Hamissi, M. Babes","doi":"10.1109/GMAG.2003.1219672","DOIUrl":null,"url":null,"abstract":"The realized work consists in modeling and solving a constraint satisfaction problem (CSP) by a neural approach. We intend to develop an algorithm based on the conception of a basic neural network able to solve some instantiations of the CSP. The variables are associated to the input and the output nodes of the network and the constraints correspond to the nodes of the hidden layers. The obtained results show that the network can be trapped in local minima. Therefore, we intend to modify the way of calculating the weights of the input layer, so as to improve the structure of the network initially conceived.","PeriodicalId":343290,"journal":{"name":"2003 International Conference on Geometric Modeling and Graphics, 2003. Proceedings","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A neural approach for solving the constraint satisfaction problem\",\"authors\":\"S. Hamissi, M. Babes\",\"doi\":\"10.1109/GMAG.2003.1219672\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The realized work consists in modeling and solving a constraint satisfaction problem (CSP) by a neural approach. We intend to develop an algorithm based on the conception of a basic neural network able to solve some instantiations of the CSP. The variables are associated to the input and the output nodes of the network and the constraints correspond to the nodes of the hidden layers. The obtained results show that the network can be trapped in local minima. Therefore, we intend to modify the way of calculating the weights of the input layer, so as to improve the structure of the network initially conceived.\",\"PeriodicalId\":343290,\"journal\":{\"name\":\"2003 International Conference on Geometric Modeling and Graphics, 2003. Proceedings\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2003 International Conference on Geometric Modeling and Graphics, 2003. Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GMAG.2003.1219672\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2003 International Conference on Geometric Modeling and Graphics, 2003. Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GMAG.2003.1219672","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A neural approach for solving the constraint satisfaction problem
The realized work consists in modeling and solving a constraint satisfaction problem (CSP) by a neural approach. We intend to develop an algorithm based on the conception of a basic neural network able to solve some instantiations of the CSP. The variables are associated to the input and the output nodes of the network and the constraints correspond to the nodes of the hidden layers. The obtained results show that the network can be trapped in local minima. Therefore, we intend to modify the way of calculating the weights of the input layer, so as to improve the structure of the network initially conceived.