P. L. Venetianer, P. Szolgay, K. R. Crounse, T. Roska, L. Chua
{"title":"模拟组合学和元胞自动机-键算法和布局设计","authors":"P. L. Venetianer, P. Szolgay, K. R. Crounse, T. Roska, L. Chua","doi":"10.1109/CNNA.1994.381671","DOIUrl":null,"url":null,"abstract":"This paper demonstrates how certain logic and combinatorial tasks can be solved using CNNs. The most important application generalizes a shortest path algorithm to design the layout of printed circuit boards. Besides, it is shown how cellular automata can be simulated on CNN, and tasks, such as sorting, parity analysis, histogram calculation of black-and-white images, and computing minimum Hamming distance are also solved.<<ETX>>","PeriodicalId":248898,"journal":{"name":"Proceedings of the Third IEEE International Workshop on Cellular Neural Networks and their Applications (CNNA-94)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Analog combinatorics and cellular automata-key algorithms and layout design\",\"authors\":\"P. L. Venetianer, P. Szolgay, K. R. Crounse, T. Roska, L. Chua\",\"doi\":\"10.1109/CNNA.1994.381671\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper demonstrates how certain logic and combinatorial tasks can be solved using CNNs. The most important application generalizes a shortest path algorithm to design the layout of printed circuit boards. Besides, it is shown how cellular automata can be simulated on CNN, and tasks, such as sorting, parity analysis, histogram calculation of black-and-white images, and computing minimum Hamming distance are also solved.<<ETX>>\",\"PeriodicalId\":248898,\"journal\":{\"name\":\"Proceedings of the Third IEEE International Workshop on Cellular Neural Networks and their Applications (CNNA-94)\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Third IEEE International Workshop on Cellular Neural Networks and their Applications (CNNA-94)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CNNA.1994.381671\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third IEEE International Workshop on Cellular Neural Networks and their Applications (CNNA-94)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNNA.1994.381671","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analog combinatorics and cellular automata-key algorithms and layout design
This paper demonstrates how certain logic and combinatorial tasks can be solved using CNNs. The most important application generalizes a shortest path algorithm to design the layout of printed circuit boards. Besides, it is shown how cellular automata can be simulated on CNN, and tasks, such as sorting, parity analysis, histogram calculation of black-and-white images, and computing minimum Hamming distance are also solved.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
