Research Anthology on Advancements in Quantum Technology最新文献_第2页

Quantum Internet and E-Governance 量子互联网与电子政务

Research Anthology on Advancements in Quantum Technology Pub Date : 1900-01-01 DOI: 10.4018/978-1-7998-2253-0.ch006

Manan Thakkar, Rakeshkumar Vanzara

引用次数: 0

An Efficient Handwritten Character Recognition Using Quantum Multilayer Neural Network (QMLNN) Architecture 基于量子多层神经网络(QMLNN)结构的高效手写字符识别

Research Anthology on Advancements in Quantum Technology Pub Date : 1900-01-01 DOI: 10.4018/978-1-7998-8593-1.ch021

Debanjan Konar, S. K. Kar

引用次数: 0

Quantum Cryptography Key Distribution 量子密码学密钥分配

Research Anthology on Advancements in Quantum Technology Pub Date : 1900-01-01 DOI: 10.4018/978-1-7998-2253-0.ch005

B. Chander

引用次数: 1

A Generalized Parallel Quantum Inspired Evolutionary Algorithm Framework for Hard Subset Selection Problems 硬子集选择问题的广义并行量子启发进化算法框架

Research Anthology on Advancements in Quantum Technology Pub Date : 1900-01-01 DOI: 10.4018/978-1-7998-8593-1.ch003

Sulabh Bansal, C. Patvardhan

{"title":"A Generalized Parallel Quantum Inspired Evolutionary Algorithm Framework for Hard Subset Selection Problems","authors":"Sulabh Bansal, C. Patvardhan","doi":"10.4018/978-1-7998-8593-1.ch003","DOIUrl":"https://doi.org/10.4018/978-1-7998-8593-1.ch003","url":null,"abstract":"Quantum-inspired evolutionary algorithms (QIEAs) like all evolutionary algorithms (EAs) perform well on many problems but cannot perform equally better than random for all problems due to the No Free Lunch theorem. However, a framework providing near-optimal solutions on reasonably hard instances of a large variety of problems is feasible. It has an effective general strategy for easy incorporation of domain information along with effective control on the randomness in the search process to balance the exploration and exploitation. Moreover, its effective parallel implementation is desired in the current age. Such a Generalized Parallel QIEA framework designed for the solution of Subset Selection Problems is presented here. The computational performance results demonstrate its effectiveness in the solution of different large-sized hard SSPs like the Difficult Knapsack Problem, the Quadratic Knapsack Problem and the Multiple Knapsack problem. This is the first such a generalized framework and is a major step towards creating an adaptive search framework for combinatorial optimization problems.","PeriodicalId":443838,"journal":{"name":"Research Anthology on Advancements in Quantum Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116052149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0