標(biāo)題: Titlebook: Bio-Inspired Computing: Theories and Applications; 16th International C Linqiang Pan,Zhihua Cui,Lianghao Li Conference proceedings 2022 Spr [打印本頁(yè)] 作者: 拖累 時(shí)間: 2025-3-21 19:44
書(shū)目名稱(chēng)Bio-Inspired Computing: Theories and Applications影響因子(影響力)
書(shū)目名稱(chēng)Bio-Inspired Computing: Theories and Applications影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Bio-Inspired Computing: Theories and Applications網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Bio-Inspired Computing: Theories and Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Bio-Inspired Computing: Theories and Applications被引頻次
書(shū)目名稱(chēng)Bio-Inspired Computing: Theories and Applications被引頻次學(xué)科排名
書(shū)目名稱(chēng)Bio-Inspired Computing: Theories and Applications年度引用
書(shū)目名稱(chēng)Bio-Inspired Computing: Theories and Applications年度引用學(xué)科排名
書(shū)目名稱(chēng)Bio-Inspired Computing: Theories and Applications讀者反饋
書(shū)目名稱(chēng)Bio-Inspired Computing: Theories and Applications讀者反饋學(xué)科排名
作者: Root494 時(shí)間: 2025-3-21 21:33 作者: HERE 時(shí)間: 2025-3-22 00:47 作者: 道學(xué)氣 時(shí)間: 2025-3-22 08:10 作者: 單調(diào)性 時(shí)間: 2025-3-22 12:37
Black Widow Spider Algorithm Based on Differential Evolution and Random Disturbancential evolution strategy is introduced to avoid unnecessary exploration. At the same time, the random disturbance factor is used to improve the local exploitation performance of the black widow algorithm, and the memory function is added to the individual to improve the population‘s reproductive str作者: 無(wú)表情 時(shí)間: 2025-3-22 13:52 作者: blithe 時(shí)間: 2025-3-22 18:55
A Cuckoo Quantum Evolutionary Algorithm for the Graph Coloring Problem A cuckoo quantum evolutionary algorithm (CQEA) is proposed for the GCP, which is based on the framework of quantum-inspired evolutionary algorithm. To reduce iterations for the search of the chromatic number, the initial quantum population is generated with random initialization assisted by inherit作者: 親屬 時(shí)間: 2025-3-22 22:30
Feature Selection Algorithm Based on Discernibility Matrix and Fruit Fly Optimization can quickly search for feature subsets, effectively reducing the computational workload; However, in some decision tables of this type of method, there were also problems such as the searched feature subset containing redundant features, which led to a decrease in accuracy. Aiming at such problems 作者: exigent 時(shí)間: 2025-3-23 03:14 作者: 啞巴 時(shí)間: 2025-3-23 07:38
Implementation and Application of NSGA-III Improved Algorithm in Multi-objective Environmentr more objectives) has gradually become a hot spot. NSGA-III algorithm is effective in dealing with evolutionary multi-objective optimization problems. In this paper, we recognize some advantages of the existing NSGA-III algorithm and make some improvements. The improved NSGA-III algorithm has highe作者: 我不死扛 時(shí)間: 2025-3-23 10:45
A Differential Evolution Algorithm for Multi-objective Mixed-Variable Optimization Problemsmultiple complex functions, constraints and mixed types of decision variables. Compared with single objective mixed-variable optimization problems (MVOPs), the decision space of MO-MVOPs presents more complex spatial distribution features. These features of MO-MVOPs make solving such problems face a作者: travail 時(shí)間: 2025-3-23 17:46 作者: 個(gè)阿姨勾引你 時(shí)間: 2025-3-23 20:33
Adaptive Multi-strategy Learning Particle Swarm Optimization with Evolutionary State Estimation mode is relatively fixed, and it is easy to be trapped in the local optimum. Most variants of PSO use only one learning strategy in the entire evolution process, which may affect their performance when different learning strategies are required under different evolution states. In order to deal wit作者: HEDGE 時(shí)間: 2025-3-24 01:40 作者: 殘忍 時(shí)間: 2025-3-24 05:08
Adaptive Differential Privacy Budget Allocation Algorithm Based on Random Foresty protection method is to add differential privacy in the process of data mining, but the unreasonable privacy budget allocation leads to unsatisfactory classification results. To solve this problem, an adaptive differential privacy budget allocation algorithm RFDPP-weight based on random forest is 作者: textile 時(shí)間: 2025-3-24 06:59
A Node Influence Based Memetic Algorithm for Community Detection in Complex Networksion treats finding the community structure as an optimization problem, which has received great attentions in a variety of fields these years. Several community detection methods have been proposed. To make an approach of detecting the community structure in a more efficient way, a node influence ba作者: 意外 時(shí)間: 2025-3-24 13:14 作者: occurrence 時(shí)間: 2025-3-24 18:15
A Hybrid Multi-objective Coevolutionary Approach for the Multi-user Agile Earth Observation Satellitagement. In this study, a MU-AEOSSP is addressed to tackle the failure rate and the fairness of different users simultaneously. A hybrid multi-objective coevolutionary approach (HMOCA) is then proposed to handle the complicate constraints and to optimize the objectives. HMOCA evolves two populations作者: 廣大 時(shí)間: 2025-3-24 19:11
Conference proceedings 2022: Theories and Applications, BIC-TA 2021, held in Taiyuan, China, in December 2021.?.The 67 papers presented were thoroughly reviewed and selected from 211 submissions. The papers are organized in the following topical sections: ?evolutionary computation and swarm intelligence; DNA and molecular computing; ?machine learning and computer vision..作者: 強(qiáng)制性 時(shí)間: 2025-3-25 02:41 作者: Organization 時(shí)間: 2025-3-25 05:43 作者: 污穢 時(shí)間: 2025-3-25 09:10
Bio-Inspired Computing: Theories and Applications978-981-19-1256-6Series ISSN 1865-0929 Series E-ISSN 1865-0937 作者: insincerity 時(shí)間: 2025-3-25 12:46
Die Gewinnung von Fichtensamen betr,ortance of picking stations, which affects the efficiency of the system, is often ignored. To tackle this problem, this study has designed a novel scheduling model to improve the efficiency of the multi-robot system. Unlike the original scheduling model, the queuing time is taken into account in the作者: 褪色 時(shí)間: 2025-3-25 18:00
https://doi.org/10.1007/978-3-642-94230-3nergy balance problem becoming more and more prominent. To meet this challenge, a multi-objective wireless sensor network energy balance model is described, which comprehensively considers the energy consumption of sensor node and neighbor node, sensor node and base station. Meanwhile, an improved m作者: d-limonene 時(shí)間: 2025-3-25 22:41
https://doi.org/10.1007/978-3-662-37977-6works do not require preset base stations and are suitable for special scenarios such as rapid networking on the battlefields and post-disaster rescues. The distance vector-based AODV routing protocol is an on-demand routing protocol specially developed for Ad Hoc networks. Due to the simplicity of 作者: Fabric 時(shí)間: 2025-3-26 03:35
https://doi.org/10.1007/978-3-7091-9374-7istics. The artificial bee colony algorithm (ABC) is one of the popular evolutionary algorithms to solve large-scale scheduling problems. A new artificial bee colony algorithm is proposed, named the learning-based artificial bee colony algorithm (LB-ABC). We proposed two new learning strategies, nam作者: 出汗 時(shí)間: 2025-3-26 07:03 作者: IRS 時(shí)間: 2025-3-26 09:26 作者: 拋射物 時(shí)間: 2025-3-26 16:02 作者: 繼而發(fā)生 時(shí)間: 2025-3-26 20:13
L. H. Eckensberger,R. Kreibich-Fischer can quickly search for feature subsets, effectively reducing the computational workload; However, in some decision tables of this type of method, there were also problems such as the searched feature subset containing redundant features, which led to a decrease in accuracy. Aiming at such problems 作者: aerial 時(shí)間: 2025-3-26 21:45
https://doi.org/10.1007/978-3-7091-9374-7ture set is one of the problems that many researches try to solve. In view of the existing neighborhood rough set and ant colony optimization feature selection methods, the algorithms are premature, and the searched feature subset contains redundancy and other problems. Improvements have been made i作者: 雪上輕舟飛過(guò) 時(shí)間: 2025-3-27 04:02 作者: 逃避責(zé)任 時(shí)間: 2025-3-27 07:02 作者: Concomitant 時(shí)間: 2025-3-27 10:52 作者: GUISE 時(shí)間: 2025-3-27 13:57
Jahrbuch der Psychoonkologie 1997 mode is relatively fixed, and it is easy to be trapped in the local optimum. Most variants of PSO use only one learning strategy in the entire evolution process, which may affect their performance when different learning strategies are required under different evolution states. In order to deal wit作者: aviator 時(shí)間: 2025-3-27 19:58 作者: 按時(shí)間順序 時(shí)間: 2025-3-27 22:37
Ohne meinen Krebs w?re ich l?ngst gestorbeny protection method is to add differential privacy in the process of data mining, but the unreasonable privacy budget allocation leads to unsatisfactory classification results. To solve this problem, an adaptive differential privacy budget allocation algorithm RFDPP-weight based on random forest is 作者: leniency 時(shí)間: 2025-3-28 04:57
Ohne meinen Krebs w?re ich l?ngst gestorbenion treats finding the community structure as an optimization problem, which has received great attentions in a variety of fields these years. Several community detection methods have been proposed. To make an approach of detecting the community structure in a more efficient way, a node influence ba作者: obsession 時(shí)間: 2025-3-28 07:20
Ohne meinen Krebs w?re ich l?ngst gestorbengeneration strategies. Moreover, CHTs have different search capabilities and each generation strategy in a differential evolution is applicable to particular type of constrained multi-objective optimization problems (CMOPs). To automatically select appropriate CHT and generation strategy, an adaptiv作者: ITCH 時(shí)間: 2025-3-28 13:39 作者: 鴿子 時(shí)間: 2025-3-28 15:50 作者: resistant 時(shí)間: 2025-3-28 19:54
Improved AODV Routing Protocol Based on Multi-objective Simulated Annealing Algorithms to extend the lifetime of the network while allocating network resources reasonably. This paper uses Matlab to build an Ad hoc network, and carries out simulation experiments in the topology of 25 nodes. In addition, two improved AODV algorithms RA-AODV and IEEAODV are selected to compare with the作者: 同謀 時(shí)間: 2025-3-28 22:55 作者: Adjourn 時(shí)間: 2025-3-29 05:47
Feature Selection Method Based on Ant Colony Optimization Algorithm and Improved Neighborhood Discertimization algorithm and the improvement of the neighborhood discernibility matrix. Numerical examples and data set experiments show that the new feature selection method improves accuracy and reduces the number of iterations.作者: 調(diào)情 時(shí)間: 2025-3-29 07:31
Implementation and Application of NSGA-III Improved Algorithm in Multi-objective Environmentironments with all values, the improved NSGA-III algorithm has 22 optimal values, accounting for 78.57%. After that, we analyze the results and put forward the future improvement and research direction.作者: quiet-sleep 時(shí)間: 2025-3-29 12:57 作者: 匍匐前進(jìn) 時(shí)間: 2025-3-29 16:07
Adaptive Multi-strategy Learning Particle Swarm Optimization with Evolutionary State Estimationng strategy, three state called exploration state, balance state and exploitation state are corresponding to three learning strategies respectively. The experimental results show that AMSLPSO performs better than or at least comparable with some other advanced PSO variants, on the 30 benchmark funct作者: SEMI 時(shí)間: 2025-3-29 21:25
Adaptive Differential Privacy Budget Allocation Algorithm Based on Random Forested according to the decision tree weight. In the final prediction stage, the classification result with the largest weight of the corresponding decision tree is taken as the result of the random forest algorithm, so as to further improve the classification accuracy of the random forest algorithm. Th作者: 水汽 時(shí)間: 2025-3-30 01:46
A Node Influence Based Memetic Algorithm for Community Detection in Complex Networkslti-level greedy search is deployed to find the potential optimal solutions quickly and effectively. Extensive experiments on 28 synthetic and 6 real-world networks demonstrate that compared with 11 existing algorithms, the proposed NIMA has effective performance on detecting communities in complex 作者: Torrid 時(shí)間: 2025-3-30 04:44
A Hybrid Multi-objective Coevolutionary Approach for the Multi-user Agile Earth Observation Satellitnsively tested and compared with three classical multi-objective evolutionary algorithms (NSGAII, MOEA/D, IBEA) and two methods of the time-dependent multi-objective AEOSSP (D-MOMA-TD and I-MOMA-TD) on several instances which are generated based on real-word situation. Experiment results show that t作者: 專(zhuān)橫 時(shí)間: 2025-3-30 09:48
https://doi.org/10.1007/978-3-662-37977-6s to extend the lifetime of the network while allocating network resources reasonably. This paper uses Matlab to build an Ad hoc network, and carries out simulation experiments in the topology of 25 nodes. In addition, two improved AODV algorithms RA-AODV and IEEAODV are selected to compare with the作者: Costume 時(shí)間: 2025-3-30 14:34 作者: 繁重 時(shí)間: 2025-3-30 19:21 作者: TEM 時(shí)間: 2025-3-31 00:15 作者: strdulate 時(shí)間: 2025-3-31 00:59
Ern?hrung und die Behandlung von Krebsenerated by using the selection operator in NSGA-II. In addition, the local search in MCDE. is utilized to improve the parents. The quality of the newly generated individual depends on the dominance relationship between itself and its parent. The experimental results of two actual MO-MVOPs are obtai作者: FEMUR 時(shí)間: 2025-3-31 06:14
Jahrbuch der Psychoonkologie 1997ng strategy, three state called exploration state, balance state and exploitation state are corresponding to three learning strategies respectively. The experimental results show that AMSLPSO performs better than or at least comparable with some other advanced PSO variants, on the 30 benchmark funct作者: 變形 時(shí)間: 2025-3-31 11:44 作者: 有組織 時(shí)間: 2025-3-31 16:20 作者: 漫不經(jīng)心 時(shí)間: 2025-3-31 17:56 作者: 粗糙 時(shí)間: 2025-3-31 22:31 作者: Esophagitis 時(shí)間: 2025-4-1 02:28
https://doi.org/10.1007/978-3-7091-9374-7ategy, it further reduces the possibility of falling into local and ensures the balance between exploitation and exploration. By testing benchmark optimization functions and engineering problems, it shows the advantages of the improved algorithm, and has better progress in global search ability and convergence speed.作者: Affluence 時(shí)間: 2025-4-1 06:38 作者: 襲擊 時(shí)間: 2025-4-1 13:14
Conference proceedings 2022: Theories and Applications, BIC-TA 2021, held in Taiyuan, China, in December 2021.?.The 67 papers presented were thoroughly reviewed and selected from 211 submissions. The papers are organized in the following topical sections: ?evolutionary computation and swarm intelligence; DNA and molecular com作者: 半身雕像 時(shí)間: 2025-4-1 16:25
