检索结果-内蒙古大学图书馆

arXiv 2021年

作者： Reinke, Annika Tizabi, Minu D. Sudre, Carole H. Eisenmann, Matthias Rädsch, Tim Baumgartner, Michael Acion, Laura Antonelli, Michela Arbel, Tal Bakas, Spyridon Bankhead, Peter Benis, Arriel Blaschko, Matthew Buettner, Florian Cardoso, M. Jorge Chen, Jianxu Cheplygina, Veronika Christodoulou, Evangelia Cimini, Beth A. Collins, Gary S. Engelhardt, Sandy Farahani, Keyvan Ferrer, Luciana Galdran, Adrian van Ginneken, Bram Glocker, Ben Godau, Patrick Haase, Robert Hamprecht, Fred Hashimoto, Daniel A. Heckmann-Nötzel, Doreen Hirsch, Peter Hoffman, Michael M. Huisman, Merel Isensee, Fabian Jannin, Pierre Kahn, Charles E. Kainmueller, Dagmar Kainz, Bernhard Karargyris, Alexandros Karthikesalingam, Alan Kavur, A. Emre Kenngott, Hannes Kleesiek, Jens Kleppe, Andreas Koehler, Sven Kofler, Florian Kopp-Schneider, Annette Kooi, Thijs Kozubek, Michal Kreshuk, Anna Kurc, Tahsin Landman, Bennett A. Litjens, Geert Madani, Amin Maier-Hein, Klaus Martel, Anne L. Mattson, Peter Meijering, Erik Menze, Bjoern Moher, David Moons, Karel G.M. Müller, Henning Nichyporuk, Brennan Nickel, Felix Noyan, M. Alican Petersen, Jens Polat, Gorkem Rafelski, Susanne M. Rajpoot, Nasir Reyes, Mauricio Rieke, Nicola Riegler, Michael A. Rivaz, Hassan Saez-Rodriguez, Julio Sánchez, Clara I. Schroeter, Julien Saha, Anindo Selver, M. Alper Sharan, Lalith Shetty, Shravya Smeden, Maarten V.A.N. Stieltjes, Bram Summers, Ronald M. Taha, Abdel A. Tiulpin, Aleksei Tsaftaris, Sotirios A. Calster, Ben V.A.N. Varoquaux, Gaël Wiesenfarth, Manuel Yaniv, Ziv R. Jäger, Paul Maier-Hein, Lena Division of Intelligent Medical Systems and HI Helmholtz Imaging Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Division of Intelligent Medical Systems Heidelberg Germany NCT Heidelberg DKFZ University Medical Center Heidelberg Germany MRC Unit for Lifelong Health and Ageing UCL Centre for Medical Image Computing Department of Computer Science University College London London United Kingdom School of Biomedical Engineering and Imaging Science King’s College London London United Kingdom Division of Medical Image Computing Heidelberg Germany Instituto de Cálculo CONICET – Universidad de Buenos Aires Buenos Aires Argentina Centre for Medical Image Computing University College London London United Kingdom McGill University Montréal Canada Division of Computational Pathology Dept of Pathology & Laboratory Medicine Indiana University School of Medicine IU Health Information and Translational Sciences Building Indianapolis United States University of Pennsylvania Richards Medical Research Laboratories FL7 PhiladelphiaPA United States Institute of Genetics and Cancer University of Edinburgh Edinburgh United Kingdom Department of Digital Medical Technologies Holon Institute of Technology Holon Israel European Federation for Medical Informatics Le Mont-sur-Lausanne Switzerland Center for Processing Speech and Images Department of Electrical Engineering KU Leuven Kasteelpark Arenberg 10 - box 2441 Leuven3001 Belgium Frankfurt/Mainz DKFZ UCT Frankfurt-Marburg Germany Heidelberg Germany Goethe University Frankfurt Department of Medicine Germany Goethe University Frankfurt Department of Informatics Germany Frankfurt Cancer Insititute Germany Leibniz-Institut für Analytische Wissenschaften – ISAS – e.V. Dortmund Germany Department of Computer Science IT University of Copenhagen Copenhagen Denmark Imaging Platform Broad Institute of MIT and Harvard CambridgeMA United States Centre for St

While the importance of automatic image analysis is continuously increasing, recent meta-research revealed major flaws with respect to algorithm validation. performance metrics are particularly key for meaningful, objective, and transparent performance assessment and validation of the used automatic algorithms, but relatively little attention has been given to the practical pitfalls when using specific metrics for a given image analysis task. These are typically related to (1) the disregard of inherent metric properties, such as the behaviour in the presence of class imbalance or small target structures, (2) the disregard of inherent data set properties, such as the non-independence of the test cases, and (3) the disregard of the actual biomedical domain interest that the metrics should reflect. This living dynamically document has the purpose to illustrate important limitations of performance metrics commonly applied in the field of image analysis. In this context, it focuses on biomedical image analysis problems that can be phrased as image-level classification, semantic segmentation, instance segmentation, or object detection task. The current version is based on a Delphi process on metrics conducted by an international consortium of image analysis experts from more than 60 institutions worldwide. © 2021, CC BY.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

Adaptive morphological reconstruction for seeded image segmentation

arXiv

引用

arXiv 2019年

作者： Lei, Tao Jia, Xiaohong Liu, Tongliang Liu, Shigang Meng, Hongying Nandi, Asoke K. School of Electronical and Information Engineering Shaanxi University of Science and Technology Xi’an710021 China School of Computer Science Northwestern Polytechnical University Xi’an710072 China School of Electronical and Information Engineering Shaanxi University of Science and Technology Xi’an710021 China School of Computer Science University of Sydney Sydney Australia School of Computer Science Shaanxi Normal University Xi’an710119 China Department of Electronic and Computer Engineering Brunel University London Uxbridge MiddlesexUB8 3PH United Kingdom Department of Electronic and Computer Engineering Brunel University London Uxbridge MiddlesexUB8 3PH United Kingdom Key Laboratory of Embedded Systems and Service Computing Col- lege of Electronic and Information Engineering Tongji University Shanghai200092 China

—Morphological reconstruction (MR) is often employed by seeded image segmentation algorithms such as watershed transform and power watershed as it is able to filter seeds (regional minima) to reduce over-segmentation. However, MR might mistakenly filter meaningful seeds that are required for generating accurate segmentation and it is also sensitive to the scale because a single-scale structuring element is employed. In this paper, a novel adaptive morphological reconstruction (AMR) operation is proposed that has three advantages. Firstly, AMR can adaptively filter useless seeds while preserving meaningful ones. Secondly, AMR is insensitive to the scale of structuring elements because multiscale structuring elements are employed. Finally, AMR has two attractive properties: monotonic increasingness and convergence that help seeded segmentation algorithms to achieve a hierarchical segmentation. Experiments clearly demonstrate that AMR is useful for improving algorithms of seeded image segmentation and seed-based spectral segmentation. Compared to several state-of-the-art algorithms, the proposed algorithms provide better segmentation results requiring less computing time. Source code is available at https://***/SUST-reynole/AMR. Copyright © 2019, The Authors. All rights reserved.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Correlation-Aware Virtual Machine Placement in Data Center Networks 7th

Correlation-Aware Virtual Machine Placement in Data Center N...

引用

7th EAI International Conference on Cloud computing, CloudComp 2016 and 1st EAI International Conference on Security and Privacy in New computing Environments, SPNCE 2016

作者： Chen, Tao Zhu, Yaoming Gao, Xiaofeng Kong, Linghe Chen, Guihai Wang, Yongjian Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of Information Network Security of Ministry of Public Security The Third Research Institute of Ministry of Public Security Shanghai China

ISBN: (纸本)9783319696041

The resource utilization (CPU, memory) is a key performance metric in data center networks. The goal of the cloud platform supported by data center networks is achieving high average resource utilization while guaranteeing the quality of cloud services. Previous work focus on increasing the time-average resource utilization and decreasing the overload ratio of servers by designing various efficient virtual machine placement schemes. Unfortunately, most of virtual machine placement schemes did not involve the service level agreements and statistical methods. In this paper, we propose a correlation-aware virtual machine placement scheme that effectively places virtual machines on physical machines. First, we employ Neural Networks model to forecast the resource utilization trend according to the historical resource utilization data. Second, we design correlation-aware placement algorithms to enhance resource utilization while meeting the user-defined service level agreements. The results show that the efficiency of our virtual machine placement algorithms outperform the previous work by about 15%. © 2018, ICST Institute for computer sciences, Social Informatics and Telecommunications engineering.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

iSplit LBI: Individualized partial ranking with ties via split LBI

arXiv

引用

arXiv 2019年

作者： Xu, Qianqian Sun, Xinwei Yang, Zhiyong Cao, Xiaochun Huang, Qingming Yao, Yuan Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Microsoft Research Asia State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Tech. University of Chinese Academy of Sciences Key Laboratory of Big Data Mining and Knowledge Management CAS Peng Cheng Laboratory Department of Mathematics Hong Kong University of Science and Technology Hong Kong

Due to the inherent uncertainty of data, the problem of predicting partial ranking from pairwise comparison data with ties has attracted increasing interest in recent years. However, in real-world scenarios, different individuals often hold distinct preferences. It might be misleading to merely look at a global partial ranking while ignoring personal diversity. In this paper, instead of learning a global ranking which is agreed with the consensus, we pursue the tie-aware partial ranking from an individualized perspective. Particularly, we formulate a unified framework which not only can be used for individualized partial ranking prediction, but also be helpful for abnormal user selection. This is realized by a variable splitting-based algorithm called iSplitLBI. Specifically, our algorithm generates a sequence of estimations with a regularization path, where both the hyperparameters and model parameters are updated. At each step of the path, the parameters can be decomposed into three orthogonal parts, namely, abnormal signals, personalized signals and random noise. The abnormal signals can serve the purpose of abnormal user selection, while the abnormal signals and personalized signals together are mainly responsible for individual partial ranking prediction. Extensive experiments on simulated and real-world datasets demonstrate that our new approach significantly outperforms state-of-the-art alternatives. The code is now availiable at https://***/qianqianxu010/ NeurIPS2019-iSplitLBI. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Preface

引用

CEUR Workshop Proceedings 2022年 3304卷

作者： Jia, Weijia Yin, Jian Hu, Shaolin Peng, Shaoliang Niu, Shaozhang Srinivasa Rao, P.C. Lu, Yao Mirsaeidi, Sohrab Cao, Bin Wu, Yilin Wang, Xingbo Subramaniyam, Kannimuthu Boddu, Raja Sarath Kumar Li, Zhonghua Tao, Qian Zhang, Lei Li, Yi Ding, Deqing Wang, Dahan Zhang, Ziyan AlShawabkeh, Mahmoud Aslam, Muhammad Dib, Omar Sahibuddin, Shamsul Bin Wagh, Sanjeev J. Pardalos, Panos M. Al-Sammarraie, Najeeb Abbas Liu, Linfeng Kong, Jin-Heung Borrego, Carlos Tahir, Sabeen Wu, Zhiheng Li, Jiongcheng Xu, Yong Xie, Zhi Wang, Jiahai Cai, Hongmin Yang, Yuedong Qin, Xiaolin Beijing Normal University Zhuhai China Sun Yat-sen University China Guangdong University of Petrochemical Technology China Hunan University China Beijing University of Posts and Telecommunications China India Beijing Jiaotong University China Hebei University of Technology China Guangdong University of Education China Foshan University China Karpagam College of Engineering India Lenora College of Engineerin India Yat-sen University Guangdong High Performance Computing Society China South China University of Technology China Henan University China Wenzhou University China National University of Defense Technology China Xiamen University of Technology China Hainan Tropical Ocean University China Guangxi Normal University for Nationalities China Wuhan University China Wenzhou-Kean University China School of Software Engineering Universiti Teknologi Malaysia Information Technology Government College of Engineering Karad India Department of Industrial & Systems Engineering University of Florida United States Al-Madinah International University Faculty of Computer and Information Technology Malaysia School of Computer Science and Technology Nanjing University of Posts and Telecommunications China School of Computer and Information Engineering Kwangwoon University Korea Republic of Departament Enginyeria of Information Comunicacions Autonomous University of Barcelona Spain Information Technology Department King AbdulAziz University Jeddah Saudi Arabia Institute of Manufacturing GDAS China Guangdong Planning and Designing Institute of Telecommunications Co. Ltd China Guangzhou Institutes of Biomedicine and Health Chinese Academy of Sciences China Cheng Du Information Technology of Chinese Academy of Sciences Co. Ltd China

来源：评论

学校读者我要写书评

暂无评论

Coherence-based automated essay scoring using self-attention 17th

Coherence-based automated essay scoring using self-attention

引用

17th China National Conference on Computational Linguistics, CCL 2018 and 6th International Symposium on Natural Language Processing Based on Naturally Annotated Big Data, NLP-NABD 2018

作者： Li, Xia Chen, Minping Nie, Jianyun Liu, Zhenxing Feng, Ziheng Cai, Yingdan Key Laboratory of Language Engineering and Computing Guangdong University of Foreign Studies Guangzhou China School of Information Science and Technology/School of Cyber Security Guangdong University of Foreign Studies Guangzhou China Department of Computer Science and Operations Research University of Montreal Montreal Canada

ISBN: (纸本)9783030017156

Automated essay scoring aims to score an essay automatically without any human assistance. Traditional methods heavily rely on manual feature engineering, making it expensive to extract the features. Some recent studies used neural-network-based scoring models to avoid feature engineering. Most of them used CNN or RNN to learn the representation of the essay. Although these models can cope with relationships between words within a short distance, they are limited in capturing long-distance relationships across sentences. In particular, it is difficult to assess the coherence of the essay, which is an essential criterion in essay scoring. In this paper, we use self-attention to capture useful long-distance relationships between words so as to estimate a coherence score. We tested our model on two datasets (ASAP and a new non-native speaker dataset). In both cases, our model outperforms the existing state-of-the-art models. © Springer Nature Switzerland AG 2018.

关键词： Automation

来源：评论

学校读者我要写书评

暂无评论

Spatial sparse subspace clustering for compressive spectral imaging

arXiv

引用

arXiv 2019年

作者： Zhu, Jianchen Zhang, Tong Zhao, Shengjie Hinojosa, Carlos Liu, Zengli Arce, Gonzalo R. Key Laboratory of Embedded System and Service Computing Ministry of Education School of Software Engineering Tongji University Shanghai201804 China School of Electronic and Information Engineering Tongji University Shanghai201804 China Department of System Engineering and Informatics Universidad Industrial de Santander Bucaramanga680002 Colombia Institute of information engineering and automation Computer Center Kunming University of Science and Technology Kunming650500 China Department of Electrical and Computer Engineering University of Delaware NewarkDE19716 United States

This paper aims at developing a clustering approach with spectral images directly from CASSI compressive measurements. The proposed clustering method first assumes that compressed measurements lie in the union of multiple low-dimensional subspaces. Therefore, sparse subspace clustering (SSC) is an unsupervised method that assigns compressed measurements to their respective subspaces. In addition, a 3D spatial regularizer is added into the SSC problem, thus taking full advantages of the spatial information contained in spectral images. The performance of the proposed spectral image clustering approach is improved by taking optimal CASSI measurements obtained when optimal coded apertures are used in CASSI system. Simulation with one real dataset illustrates the accuracy of the proposed spectral image clustering approach. Copyright © 2019, The Authors. All rights reserved.

关键词： Spectroscopy

来源：评论

学校读者我要写书评

暂无评论

NTIRE 2020 Challenge on Image and Video Deblurring

arXiv

引用

arXiv 2020年

作者： Seungjun, Nah Sanghyun, Son Radu, Timofte Kyoung Mu, Lee Tseng, Yu Xu, Yu-Syuan Chiang, Cheng-Ming Tsai, Yi-Min Brehm, Stephan Scherer, Sebastian Xu, Dejia Chu, Yihao Sun, Qingyan Jiang, Jiaqin Duan, Lunhao Yao, Jian Purohit, Kuldeep Suin, Maitreya Rajagopalan, A.N. Ito, Yuichi Hrishikesh, P.S. Puthussery, Densen Akhil, K.A. Jiji, C.V. Kim, Guisik Deepa, P.L. Xiong, Zhiwei Huang, Jie Liu, Dong Kim, Sangmin Nam, Hyungjoon Kim, Jisu Jeong, Jechang Huang, Shihua Fan, Yuchen Yu, Jiahui Yu, Haichao Huang, Thomas S. Zhou, Ya Li, Xin Liu, Sen Chen, Zhibo Dutta, Saikat Das, Sourya Dipta Garg, Shivam Sprague, Daniel Patel, Bhrij Huck, Thomas Department of ECE ASRI SNU Korea Republic of Computer Vision Lab ETH Zurich Switzerland MediaTek Inc University of Augsburg Chair for Multimedia Computing and Computer Vision Lab Germany Peking University China Beijing University of Posts and Telecommunications China Beijing Jiaotong University China Wuhan University China Indian Institute of Technology Madras India Vermilion College of Engineering Trivandrum India CVML Chung-Ang University Korea Republic of APJ Abdul Kalam Technological University India University of Science and Technology of China China Image Communication Signal Processing Laboratory Hanyang University Korea Republic of Southern University of Science and Technology China University of Illinois at Urbana-Champaign United States CAS Key Laboratory of Technology in Geo-Spatial Information Processing and Application System University of Science and Technology of China China IIT Madra Jadavpur University India University of Texas Austin United States Duke University Computer Science Department United States

Motion blur is one of the most common degradation artifacts in dynamic scene photography. This paper reviews the NTIRE 2020 Challenge on Image and Video Deblurring. In this challenge, we present the evaluation results from 3 competition tracks as well as the proposed solutions. Track 1 aims to develop single-image deblurring methods focusing on restoration quality. On Track 2, the image deblurring methods are executed on a mobile platform to find the balance of the running speed and the restoration accuracy. Track 3 targets developing video deblurring methods that exploit the temporal relation between input frames. In each competition, there were 163, 135, and 102 registered participants and in the final testing phase, 9, 4, and 7 teams competed. The winning methods demonstrate the state-of-the-art performance on image and video deblurring tasks. Copyright © 2020, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Search for exclusive Higgs and Z boson decays to ϕγ and ργ with the ATLAS detector

引用

Journal of high Energy Physics 2023年第12期2023卷 1-21页

作者： Aaboud, M. Aad, G. Abbott, B. Abdinov, O. Abeloos, B. Abidi, S. H. AbouZeid, O. S. Abraham, N. L. Abramowicz, H. Abreu, H. Abreu, R. Abulaiti, Y. Acharya, B. S. Adachi, S. Adamczyk, L. Adelman, J. Adersberger, M. Adye, T. Affolder, A. A. Afik, Y. Agatonovic-Jovin, T. Agheorghiesei, C. Aguilar-Saavedra, J. A. Ahlen, S. P. Ahmadov, F. Aielli, G. Akatsuka, S. Akerstedt, H. Åkesson, T. P. A. Akilli, E. Akimov, A. V. Alberghi, G. L. Albert, J. Albicocco, P. Alconada Verzini, M. J. Alderweireldt, S. C. Aleksa, M. Aleksandrov, I. N. Alexa, C. Alexander, G. Alexopoulos, T. Alhroob, M. Ali, B. Aliev, M. Alimonti, G. Alison, J. Alkire, S. P. Allbrooke, B. M. M. Allen, B. W. Allport, P. P. Aloisio, A. Alonso, A. Alonso, F. Alpigiani, C. Alshehri, A. A. Alstaty, M. I. Alvarez Gonzalez, B. Álvarez Piqueras, D. Alviggi, M. G. Amadio, B. T. Amaral Coutinho, Y. Amelung, C. Amidei, D. Amor Dos Santos, S. P. Amoroso, S. Amundsen, G. Anastopoulos, C. Ancu, L. S. Andari, N. Andeen, T. Anders, C. F. Anders, J. K. Anderson, K. J. Andreazza, A. Andrei, V. Angelidakis, S. Angelozzi, I. Angerami, A. Anisenkov, A. V. Anjos, N. Annovi, A. Antel, C. Antonelli, M. Antonov, A. Antrim, D. J. Anulli, F. Aoki, M. Aperio Bella, L. Arabidze, G. Arai, Y. Araque, J. P. Araujo Ferraz, V. Arce, A. T. H. Ardell, R. E. Arduh, F. A. Arguin, J-F. Argyropoulos, S. Arik, M. Armbruster, A. J. Armitage, L. J. Arnaez, O. Arnold, H. Arratia, M. Arslan, O. Artamonov, A. Artoni, G. Artz, S. Asai, S. Asbah, N. Ashkenazi, A. Asquith, L. Assamagan, K. Astalos, R. Atkinson, M. Atlay, N. B. Augsten, K. Avolio, G. Axen, B. Ayoub, M. K. Azuelos, G. Baas, A. E. Baca, M. J. Bachacou, H. Bachas, K. Backes, M. Bagnaia, P. Bahmani, M. Bahrasemani, H. Baines, J. T. Bajic, M. Baker, O. K. Bakker, P. J. Baldin, E. M. Balek, P. Balli, F. Balunas, W. K. Banas, E. Bandyopadhyay, A. Banerjee, Sw. Bannoura, A. A. E. Barak, L. Barberio, E. L. Barberis, D. Barbero, M. Barillari, T. Barisits, M.-S. Barkeloo, J. T. Barklow, T. Barlow, N. Barnes, S. L. Barnett, B. M. Barnett, R. M. Barno Faculté des Sciences Université Mohamed Premier and LPTPM Oujda Morocco CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman United States of America Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan LAL Univ. Paris-Sud CNRS/IN2P3 Université Paris-Saclay Orsay France Department of Physics University of Toronto Toronto Canada Santa Cruz Institute for Particle Physics University of California Santa Cruz Santa Cruz United States of America Department of Physics and Astronomy University of Sussex Brighton United Kingdom Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion: Israel Institute of Technology Haifa Israel Center for High Energy Physics University of Oregon Eugene United States of America Department of Physics Stockholm University Stockholm Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy Department of Physics King’s College London London United Kingdom International Center for Elementary Particle Physics and Department of Physics The University of Tokyo Tokyo Japan AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Department of Physics Northern Illinois University DeKalb United States of America Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Institute of Physics University of Belgrade Belgrade Serbia Department of Physics Alexandru Ioan Cuza University of Iasi Iasi Romania Laboratório de Instrumentação e Física Experimental de Partículas – LIP Lisboa Portugal Departamento de Fisica Teorica y del Cosmos Universidad de Granada Granada Portugal Department of Physics Boston University Boston United States of America Joi

来源：评论

学校读者我要写书评

暂无评论

A chaotic artificial bee colony algorithm based on lévy search

A chaotic artificial bee colony algorithm based on lévy sea...

引用

作者： Lin, Shijie Dong, Chen Wang, Zhiqiang Guo, Wenzhong Chen, Zhenyi Ye, Yin College of Mathematics and Computer Science Fuzhou University Fuzhou350116 China Key Laboratory of Information Security of Network Systems Fuzhou350116 China Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China Department of Electrical Engineering University of South Florida TampaFL33620 United States

A Lévy search strategy based chaotic artificial bee colony algorithm (LABC) is proposed in this paper. The chaotic sequence, global optimal mechanism and Lévy flight mechanism were introduced respectively into the initialization, the employed bee search and the onlooker bee search. The experiments show that the proposed algorithm performed better in convergence speed, global search ability and optimization accuracy than other improved ABC. Copyright © 2018 The Institute of Electronics, information and Communication Engineers.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：