Proceedings of Fifth International Conference on Soft Computing for Problem Solving: SocProS 2015, Volume 2 This two volume book is based on the research papers presented at the 5th International Conference on Soft Computing for Problem Solving (SocProS 2015) and... M Pant,K Deep,JC Bansal,....
海外直订Soft Computing for Problem Solving: Socpros 2017, Volume 1 解决问题的软计算:Socpros 2017,第1卷 作者:Bansal,JagdishChand出版社:Springer出版时间:2019年01月 手机专享价 ¥ 当当价降价通知 ¥2386 配送至 广东佛山市 至北京市东城区
Soft Computing for Problem SolvingA Deep Neural Model CNN-LSTM Network for Automated Sleep Staging Based on a Single-Channel EEG Signal Part of theLecture Notes in Networks and SystemsBook Series (volume 547) Editors: Thakur, Manoj; Agnihotri, Samar; Rajpurohit, Bharat Singh;...
This book presents outcomes of the 9th International Conference on Soft Computing for Problem Solving, SocProS 2019. The book presents the latest advances and innovations in the interdisciplinary areas of soft computing, in the areas including, but not l
11 people interested. Check out who is attending ✭ exhibiting ✭ speaking ✭ schedule & agenda ✭ reviews ✭ timing ✭ entry ticket fees. 2016 edition of International Conference Soft Computing for Problem Solving will be held at Amity Schoo
4th International conference on Soft Computing for Problem Solving (SocProS 2014) Dec. 27-29, 2014 NIT SILCHAR, ASSAM, INDIA Dear Colleagues, It is my pleasure to announce that the 4th International Conference on "Soft Computing for Problem Solving (SocProS'2014)" will be organized by NIT ...
海外直订Soft Computing for Problem Solving: Socpros 2017, Volume 1 解决问题的软计算:Socpros 2017,第1卷 作者:Bansal, Jagdish Chand出版社:Springer出版时间:2019年01月 手机专享价 ¥ 当当价 降价通知 ¥2386 配送至 广东佛山市 至 北京市东城区 服务 由“中华商务进口图书旗舰店”发货,并提供售后...
This paper presents a new hybrid intelligent system that solves the Bin Packing Problem. The methodology involves the fusion of Soft Computing by means a genetic algorithm and Hard Computing using limits criterion and deterministic strategies. The innova
Hirschberg DS (1975) A linear space algorithm for computing maximal common subsequences. Commun ACM 18(6):341–343 Article MathSciNet MATH Google Scholar Ho Wc (2017) A fast algorithm for the constrained longest common subsequence problem with small alphabet. Proceedings of the 34th workshop on...