標(biāo)題: Titlebook: Bioinspired Optimization Methods and Their Applications; 10th International C Marjan Mernik,Tome Eftimov,Matej ?repin?ek Conference proceed [打印本頁] 作者: 嬉戲 時(shí)間: 2025-3-21 16:11
書目名稱Bioinspired Optimization Methods and Their Applications影響因子(影響力)
書目名稱Bioinspired Optimization Methods and Their Applications影響因子(影響力)學(xué)科排名
書目名稱Bioinspired Optimization Methods and Their Applications網(wǎng)絡(luò)公開度
書目名稱Bioinspired Optimization Methods and Their Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Bioinspired Optimization Methods and Their Applications被引頻次
書目名稱Bioinspired Optimization Methods and Their Applications被引頻次學(xué)科排名
書目名稱Bioinspired Optimization Methods and Their Applications年度引用
書目名稱Bioinspired Optimization Methods and Their Applications年度引用學(xué)科排名
書目名稱Bioinspired Optimization Methods and Their Applications讀者反饋
書目名稱Bioinspired Optimization Methods and Their Applications讀者反饋學(xué)科排名
作者: infarct 時(shí)間: 2025-3-21 23:41 作者: Maximize 時(shí)間: 2025-3-22 00:54
Kidney and Kidney Tumor Segmentationree with low computational complexity, resulting in an accelerated surrogate process. Moreover, a new EMOEA is proposed by integrating spherical search as the core optimizer with the proposed selection scheme. Over a wide variety of benchmark problems, we show that the proposed method outperforms se作者: TOM 時(shí)間: 2025-3-22 07:17 作者: minaret 時(shí)間: 2025-3-22 11:23
Steven J. Kraus MD,Sara M. O’Hara MDure portfolios as important for the performance prediction task. We provided explanations for the behaviour of the algorithms in this scenario, by identifying the set of most important features and further using this information to compare the different algorithms and find algorithms with similar ex作者: 漫步 時(shí)間: 2025-3-22 16:41
Transplant Considerations in the Newborn, comparable to XCSF’s while allowing easier control of model structure and showing a substantially smaller sensitivity to random seeds and data splits. This increased control can aid in subsequently providing explanations for both training and final structure of the model.作者: 結(jié)果 時(shí)間: 2025-3-22 21:05 作者: Occupation 時(shí)間: 2025-3-22 22:54
Studies in Computational Intelligencemethods such as the Bayesian comparison of classifiers and the Mann-Whitney-U-Test. However, these improvements come with the cost of more mutation steps needed which in turn lengthens the training time. The third variant, in which . is decreased, does not differ from the second mutation strategy li作者: glomeruli 時(shí)間: 2025-3-23 03:24
https://doi.org/10.1007/978-3-031-36981-0iants, although still undoubtedly bringing value on these problems, does hint at complex interactions with already integrated enhancements, suggesting that extending already enhanced algorithm variants is not simple, to say the least.作者: 閃光東本 時(shí)間: 2025-3-23 07:23
https://doi.org/10.1007/978-3-031-36981-0 use it to evolve highly nonlinear balanced Boolean functions. We organize our experiments around two research questions, namely if local search (1) improves the convergence speed of GA, and (2) decreases the population diversity. Surprisingly, while our results answer affirmatively the first questi作者: Arbitrary 時(shí)間: 2025-3-23 10:36
https://doi.org/10.1007/978-3-658-20195-1ximates the Pareto frontier by connecting inherent non-dominated solutions. This approximation enables the analysis of the relationship between the weighted space and the limit of effective networks the space can generate quantitatively. Several experiments are carried out, and the result infers tha作者: 向外 時(shí)間: 2025-3-23 14:31
Kiebitzinseln in der Agrarlandschaftethod we can easily employ Independent Q-learning to train a team of agents, which facilitates robustness and scalability. By evaluating our approach on the Battlefield task from the MAgent implementation in the PettingZoo library, we observe that the evolved team of agents is able to coordinate its作者: 某人 時(shí)間: 2025-3-23 19:34
Bioinspired Optimization Methods and Their Applications10th International C作者: Sputum 時(shí)間: 2025-3-24 00:49 作者: Minutes 時(shí)間: 2025-3-24 03:02 作者: 事與愿違 時(shí)間: 2025-3-24 10:30
,CSS–A Cheap-Surrogate-Based Selection Operator for?Multi-objective Optimization,ree with low computational complexity, resulting in an accelerated surrogate process. Moreover, a new EMOEA is proposed by integrating spherical search as the core optimizer with the proposed selection scheme. Over a wide variety of benchmark problems, we show that the proposed method outperforms se作者: 動(dòng)脈 時(shí)間: 2025-3-24 13:10 作者: 軟膏 時(shí)間: 2025-3-24 17:30 作者: 新鮮 時(shí)間: 2025-3-24 21:49 作者: laceration 時(shí)間: 2025-3-25 01:43 作者: indemnify 時(shí)間: 2025-3-25 06:17 作者: HERTZ 時(shí)間: 2025-3-25 11:09
,SMOTE Inspired Extension for?Differential Evolution,iants, although still undoubtedly bringing value on these problems, does hint at complex interactions with already integrated enhancements, suggesting that extending already enhanced algorithm variants is not simple, to say the least.作者: 輪流 時(shí)間: 2025-3-25 14:53 作者: 歸功于 時(shí)間: 2025-3-25 16:19
Trade-Off of Networks on Weighted Space Analyzed via a Method Mimicking Human Walking Track Superpoximates the Pareto frontier by connecting inherent non-dominated solutions. This approximation enables the analysis of the relationship between the weighted space and the limit of effective networks the space can generate quantitatively. Several experiments are carried out, and the result infers tha作者: DAUNT 時(shí)間: 2025-3-25 22:03 作者: Notify 時(shí)間: 2025-3-26 02:49
Joshua J. Zaritsky,Bradley A. Warady MDdiscovered by GP, the Additive-Increase-Multiplicative-Decrease principle is exploited differently than in traditional protocols, by using a more aggressive window increasing policy. More importantly, the evolved protocols show an improvement of the throughput of the network of about 5%.作者: Expressly 時(shí)間: 2025-3-26 04:53 作者: HEPA-filter 時(shí)間: 2025-3-26 11:07 作者: Haphazard 時(shí)間: 2025-3-26 14:34
Kidney and Kidney Tumor Segmentationeen different algorithms as well as the similarity between the same algorithm but with different parameter settings. Our method can show if parameter settings of the same algorithm are more similar between themselves than to other algorithms and suggest a clustering based on the performance profile.作者: 沙草紙 時(shí)間: 2025-3-26 19:44
,Empirical Similarity Measure for?Metaheuristics,een different algorithms as well as the similarity between the same algorithm but with different parameter settings. Our method can show if parameter settings of the same algorithm are more similar between themselves than to other algorithms and suggest a clustering based on the performance profile.作者: Jargon 時(shí)間: 2025-3-26 21:35 作者: 導(dǎo)師 時(shí)間: 2025-3-27 01:51 作者: 獨(dú)特性 時(shí)間: 2025-3-27 07:05
https://doi.org/10.1007/978-3-030-75886-8lps and motivates the collaborative ones to be better and more fruitful. This investigation was carried out considering the (.) number of agents evacuated, (.) exit times and (.) path costs as evaluation metrics.作者: micronutrients 時(shí)間: 2025-3-27 11:12
https://doi.org/10.1007/978-3-031-54806-2An ant colony optimization algorithm is proposed for the heaviest .-subgraph problem and used for the community detection problem. Numerical experiments on real-world dynamic networks are conducted, and the results show the importance of the proposed problem and the potential of the solution method.作者: Substitution 時(shí)間: 2025-3-27 17:04
Steven J. Kraus MD,Sara M. O’Hara MDe latter are put forward on very costly problems. This paper investigates the design of hybrid strategies combining the acquisition processes of both P-SAEAs and P-SDAs to retain the best of both categories of methods. The objective is to reach robustness with respect to the computational budgets and parallel scalability.作者: fodlder 時(shí)間: 2025-3-27 19:53
Muhammad Hussain,Hussain Al-Aqrabis no single solver which ranks as the best for each benchmark function. It is even harder to choose a solver for a specific optimization problem considering the computational complexity of the solver and the problem.作者: 桶去微染 時(shí)間: 2025-3-28 00:37 作者: Medley 時(shí)間: 2025-3-28 06:08
,An Agent-Based Model to?Investigate Different Behaviours in?a?Crowd Simulation,lps and motivates the collaborative ones to be better and more fruitful. This investigation was carried out considering the (.) number of agents evacuated, (.) exit times and (.) path costs as evaluation metrics.作者: 刪減 時(shí)間: 2025-3-28 06:59
,A New Type of?Anomaly Detection Problem in?Dynamic Graphs: An Ant Colony Optimization Approach,An ant colony optimization algorithm is proposed for the heaviest .-subgraph problem and used for the community detection problem. Numerical experiments on real-world dynamic networks are conducted, and the results show the importance of the proposed problem and the potential of the solution method.作者: 束以馬具 時(shí)間: 2025-3-28 12:21
,Hybrid Acquisition Processes in?Surrogate-Based Optimization. Application to?Covid-19 Contact Reduce latter are put forward on very costly problems. This paper investigates the design of hybrid strategies combining the acquisition processes of both P-SAEAs and P-SDAs to retain the best of both categories of methods. The objective is to reach robustness with respect to the computational budgets and parallel scalability.作者: jettison 時(shí)間: 2025-3-28 17:04
,Performance Analysis of?Selected Evolutionary Algorithms on?Different Benchmark Functions,s no single solver which ranks as the best for each benchmark function. It is even harder to choose a solver for a specific optimization problem considering the computational complexity of the solver and the problem.作者: dissent 時(shí)間: 2025-3-28 22:45
,Slime Mould Algorithm: An Experimental Study of?Nature-Inspired Optimiser, nature-inspired methods. All the algorithms are applied to 22 real-world problems called CEC?2011. Achieved results illustrate the good performance of the newly proposed SMA variants, especially compared with the original SMA algorithm.作者: 確定無疑 時(shí)間: 2025-3-28 23:29 作者: 不給啤 時(shí)間: 2025-3-29 05:20
,An Agent-Based Model to?Investigate Different Behaviours in?a?Crowd Simulation,e considered: collaborative, acting attentively and collaboratively, and defector who, on the other hand, acts individually and recklessly. Many experimental simulations on different complexity scenarios were performed and each outcome indicates how the presence of a percentage of defector agents he作者: GIBE 時(shí)間: 2025-3-29 10:11
,Accelerating Evolutionary Neural Architecture Search for?Remaining Useful Life Prediction,these DNNs are usually determined empirically, usually with the goal of minimizing prediction error without considering the time needed for training. However, such a design process is time-consuming as it is essentially based on trial-and-error. Moreover, this process may be inappropriate in those i作者: sphincter 時(shí)間: 2025-3-29 12:27
,ACOCaRS: Ant Colony Optimization Algorithm for?Traveling Car Renter Problem,stics are natural choices for designing a new practical algorithm. Considering that Ant Colony Optimization (ACO) is well suited for other routing type of problems - in this paper we propose ACOCaRS - an algorithm for solving CaRS based on ACO. The proposed algorithm was investigated experimentally 作者: 輕快走過 時(shí)間: 2025-3-29 16:40 作者: incontinence 時(shí)間: 2025-3-29 23:22
,CSS–A Cheap-Surrogate-Based Selection Operator for?Multi-objective Optimization,lity. Many algorithms use ensembles of surrogate models to boost the performance. Generally, the surrogate-based model either works out the solution’s fitness by approximating the evaluation function or selects the solution by weighting the uncertainty degree of candidate solutions. This paper propo作者: 使混合 時(shí)間: 2025-3-30 02:10
,Empirical Similarity Measure for?Metaheuristics,quently, there is an interest in understanding the similarities between metaheuristics. Previous studies have done theoretical analyses based on components and search strategies, providing insights into the relationship between different algorithms. In this paper, we argue that it is also important 作者: irradicable 時(shí)間: 2025-3-30 06:43
,Evaluation of?Parallel Hierarchical Differential Evolution for?Min-Max Optimization Problems Using es or disturbances in the input data may reduce the quality of the solution. One way to find a robust solution and consider uncertainty is to formulate the problem as a min-max optimization problem. Min-max optimization aims to identify solutions which remain feasible and of good quality under even 作者: GEN 時(shí)間: 2025-3-30 08:28 作者: 獨(dú)特性 時(shí)間: 2025-3-30 13:24
,Genetic Improvement of?TCP Congestion Avoidance,ernet. Its performance heavily relies on the management of the congestion window, which regulates the amount of packets that can be transmitted on the network. In this paper, we employ Genetic Programming (GP) for evolving novel congestion policies, encoded as C++ programs. We optimize the function 作者: jabber 時(shí)間: 2025-3-30 16:46
,Hybrid Acquisition Processes in?Surrogate-Based Optimization. Application to?Covid-19 Contact Reduce computationally expensive optimization problems. Differently, Parallel Surrogate-Driven Algorithms (P-SDAs) rely on the optimization of a surrogate-informed metric of promisingness to acquire new solutions. The former are promoted to deal with moderately computationally expensive problems while th作者: 泥土謙卑 時(shí)間: 2025-3-31 00:18
,Investigating the?Impact of?Independent Rule Fitnesses in?a?Learning Classifier System,tly proposed a new rule-based learning system, SupRB, to construct compact, interpretable and transparent models by utilizing separate optimizers for the model selection tasks concerning rule discovery and rule set composition. This allows users to specifically tailor their model structure to fulfil作者: 刀鋒 時(shí)間: 2025-3-31 01:32
Modified Football Game Algorithm for Multimodal Optimization of Test Task Scheduling Problems Using industries where the reliability of the final product is fundamentally dependent on those tests while the time, workload, and agility of the production is dependent on the optimal scheduling. Scheduling problems are highly multimodal problems with high number of local and global optimum solutions. 作者: Affection 時(shí)間: 2025-3-31 06:19 作者: Decrepit 時(shí)間: 2025-3-31 11:22 作者: Neuralgia 時(shí)間: 2025-3-31 16:10 作者: 專心 時(shí)間: 2025-3-31 20:31
,SMOTE Inspired Extension for?Differential Evolution,regular basis attempting to ever more improve its performance. Typical avenues for improvement include the introduction of new (mutation) operators or parameter control schemes. Another, less common approach, is the incorporation of additional, complementary, search mechanisms. This paper proposes o
