標(biāo)題: Titlebook: Simulated Evolution and Learning; 11th International C Yuhui Shi,Kay Chen Tan,Yaochu Jin Conference proceedings 2017 Springer International [打印本頁(yè)] 作者: architect 時(shí)間: 2025-3-21 18:09
書目名稱Simulated Evolution and Learning影響因子(影響力)
書目名稱Simulated Evolution and Learning影響因子(影響力)學(xué)科排名
書目名稱Simulated Evolution and Learning網(wǎng)絡(luò)公開度
書目名稱Simulated Evolution and Learning網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Simulated Evolution and Learning被引頻次
書目名稱Simulated Evolution and Learning被引頻次學(xué)科排名
書目名稱Simulated Evolution and Learning年度引用
書目名稱Simulated Evolution and Learning年度引用學(xué)科排名
書目名稱Simulated Evolution and Learning讀者反饋
書目名稱Simulated Evolution and Learning讀者反饋學(xué)科排名
作者: jaunty 時(shí)間: 2025-3-21 22:39 作者: disciplined 時(shí)間: 2025-3-22 03:49 作者: GLOSS 時(shí)間: 2025-3-22 06:20 作者: 機(jī)械 時(shí)間: 2025-3-22 09:14
Jialong Shi,Qingfu Zhang,Bilel Derbel,Arnaud Liefooghe,Sébastien Verelintelligence technology in the construction of the Internet interactive platform of inquiry curriculum through specific case designs and conducts practical experiments. Finally this paper, through the contrastive analysis of the experimental result, demonstrates the correctness and advancement of th作者: hypnotic 時(shí)間: 2025-3-22 13:24
Jian Lin,Dike Luo,Xiaodong Li,Kaizhou Gao,Yanan Liuhing and the construction principle of the teaching system, and explores the principle and application method of the artificial intelligence technology. Based on the research of relevant concepts and theoretical basis, this paper constructs a classroom teaching ability system of English teachers com作者: 支架 時(shí)間: 2025-3-22 20:08
Yuanlong Qin,Bo Yuanalytic Hierarchy Process (AHP). This comparative study is made according to a set of criteria whose relevance and reasons for choice will be outlined. The results obtained will constitute the basis for proposing a new method whose objective exceeds data extraction.作者: Confess 時(shí)間: 2025-3-23 00:28
Yi Chen,Aimin Zhou,Rongfang Zhou,Peng He,Yong Zhao,Lihua Dongssed in this book will provide a unique source of information and inspiration for researchers working in AI, distributed coding algorithms or smart services and platforms, and for IT professionals, who can integrate the proposed methods into their practice..作者: Glossy 時(shí)間: 2025-3-23 03:33 作者: Mets552 時(shí)間: 2025-3-23 06:50 作者: Adulate 時(shí)間: 2025-3-23 10:37 作者: EVADE 時(shí)間: 2025-3-23 14:44 作者: 是剝皮 時(shí)間: 2025-3-23 19:34
Maximum Likelihood Estimation Based on Random Subspace EDA: Application to Extrasolar Planet Detectile well to large scale problems, as it consists of iterative random sampling and model fitting procedures, which results in the well-known dilemma .. A novel mechanism to perform EDAs in interactive random subspaces spanned by correlated variables is proposed and the hope is to alleviate the . for E作者: AGATE 時(shí)間: 2025-3-24 02:10 作者: HARD 時(shí)間: 2025-3-24 03:58 作者: Bmd955 時(shí)間: 2025-3-24 06:53
GP-Based Approach to Comprehensive Quality-Aware Automated Semantic Web Service Compositionrvice composition is proposed with explicit support for our representation. We also design specific genetic operation that effectively maintain the correctness of solutions during the evolutionary process. We conduct experiments to explore the effectiveness and efficiency of our GP-based approach us作者: alleviate 時(shí)間: 2025-3-24 12:10
Learning to Describe Collective Search Behavior of Evolutionary Algorithms in Solution Spacevolutional Neural Network (CNN) to learn problem-invariant features from the samples of EAs’ collective behavior. Lastly, experiment results demonstrate that our framework can effectively learn discriminative features representing collective behavior of EAs. In the behavioral feature space stretched作者: Polydipsia 時(shí)間: 2025-3-24 18:50
of selected lectures given at the two first European Summer Schools in Quantum Chemistry (ESQC), held in southern Sweden in August 1989 and 1991, respectively. The notes were written by the teachers at the school and covered a large range of topics in ab initio quantum chemistry. After the third su作者: 去世 時(shí)間: 2025-3-24 19:34 作者: 較早 時(shí)間: 2025-3-25 03:12
Muhammad Sulaman,Xinye Cai,Mustafa M?s?r,Zhun Fand individuals more and more. Artificial translation is accurate, but the cost is too high and time-consuming; while the cost of the machine translation is not only low, but the speed is fast. However, the accuracy of machine translation has been criticized by users, therefore, how to build a new gen作者: Immunotherapy 時(shí)間: 2025-3-25 06:17 作者: 現(xiàn)暈光 時(shí)間: 2025-3-25 11:25 作者: 你敢命令 時(shí)間: 2025-3-25 12:32
Jian Lin,Dike Luo,Xiaodong Li,Kaizhou Gao,Yanan Liu in people’s daily life. In the meantime, scientific and technological development has brought us many innovations, which produces new development opportunities to many traditional industries. English teaching has always been an important part of the teaching system. With the increase of internation作者: AIL 時(shí)間: 2025-3-25 16:20
Yuanlong Qin,Bo Yuanve been designed to be browsed and viewed by human users using a browser. In addition to that with the ease of publishing documents, the number of information increases from where the search for this information turns into a cumbersome and lengthy operation. Yet such information can open the door to作者: Moderate 時(shí)間: 2025-3-25 21:54 作者: 減至最低 時(shí)間: 2025-3-26 02:23
Junhua Wu,Markus Wagner,Sergey Polyakovskiy,Frank Neumannnca on October 18-20, 2017?. The book offers a comprehensive, practical review of the state-of-the-art in designing and implementing real-time intelligent computing for the areas within the conference’s scope such as robotics, intelligent alert systems, IoT, remote access control, multi-agent system作者: 過(guò)于平凡 時(shí)間: 2025-3-26 04:50
Jingda Deng,Qingfu Zhang,Hui Live been designed to be browsed and viewed by human users using a browser. In addition to that with the ease of publishing documents, the number of information increases from where the search for this information turns into a cumbersome and lengthy operation. Yet such information can open the door to作者: 按時(shí)間順序 時(shí)間: 2025-3-26 10:02
Yuhui Shi,Kay Chen Tan,Yaochu JinIncludes supplementary material: 作者: Moderate 時(shí)間: 2025-3-26 12:48
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/s/image/867481.jpg作者: 裙帶關(guān)系 時(shí)間: 2025-3-26 19:01 作者: Inexorable 時(shí)間: 2025-3-27 00:14
978-3-319-68758-2Springer International Publishing AG 2017作者: endoscopy 時(shí)間: 2025-3-27 01:32
Simulated Evolution and Learning978-3-319-68759-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 恃強(qiáng)凌弱 時(shí)間: 2025-3-27 05:18 作者: 我邪惡 時(shí)間: 2025-3-27 11:57
Exact Approaches for the Travelling Thief?Problemcy of such approaches is unknown due to their inability to find global optima. In this paper, we propose three exact algorithms and a hybrid approach to the TTP. We compare these with state-of-the-art approaches to gather a comprehensive overview on the accuracy of heuristic methods for solving small TTP instances.作者: 少量 時(shí)間: 2025-3-27 13:41 作者: Cursory 時(shí)間: 2025-3-27 18:24
Using Parallel Strategies to Speed up Pareto Local Searchperimental results show that the proposed approaches can significantly speed up PLS while maintaining about the same solution quality. In addition, we introduce a new way to visualize the search process of PLS on two-objective problems, which is helpful to understand the behaviors of PLS algorithms.作者: commodity 時(shí)間: 2025-3-27 22:46 作者: observatory 時(shí)間: 2025-3-28 04:13 作者: neolith 時(shí)間: 2025-3-28 07:49 作者: 熱情贊揚(yáng) 時(shí)間: 2025-3-28 13:16
An Efficient Local Search Algorithm for?Minimum Weighted Vertex Cover on?Massive Graphsity initial vertex cover. The other is a new exchange step for reconstructing a vertex cover. Experiments on 102 instances were conducted to confirm the effectiveness of our algorithm. The results show that the FastWVC algorithm outperforms other algorithms in terms of both solution quality and computational time in most of the instances.作者: exquisite 時(shí)間: 2025-3-28 16:31 作者: 王得到 時(shí)間: 2025-3-28 22:48
0302-9743 and Learning, SEAL 2017, held in Shenzhen, China, in November 2017.?.The 85 papers presented in this volume were carefully reviewed and selected from 145 submissions. They were organized in topical sections named: evolutionary optimisation; evolutionary multiobjective optimisation; evolutionary mach作者: Bucket 時(shí)間: 2025-3-29 01:30 作者: 大火 時(shí)間: 2025-3-29 06:15 作者: 彩色的蠟筆 時(shí)間: 2025-3-29 07:56
A Simple Brain Storm Optimization Algorithm via Visualizing Confidence Intervalsd study the brain storm optimization algorithm in depth. Through analyzing numerical effects of different components of brain storm optimization, a simplified brain storm optimization algorithm is developed. It is tested and shown to perform better than the original brain storm optimization algorith作者: cancellous-bone 時(shí)間: 2025-3-29 13:51
Simulated Annealing with a Time-Slot Heuristic for Ready-Mix Concrete Deliveryheduling constraints that have to be satisfied by considering the tradeoff between production and distribution costs. Various exact and heuristic methods have been developed to address the CDP. However, due to the limitation of the exact methods for dealing with such a complex problem, (meta-)heuris作者: 胎兒 時(shí)間: 2025-3-29 17:44
A Sequential Learnable Evolutionary Algorithm with a Novel Knowledge Base Generation Methodproblems. An algorithm pool consists of set of established algorithms. A knowledge base is trained offline. SLEA uses the algorithm-problem features to select the best algorithm from the algorithm pool. Given a problem, the default algorithm is run for the initial round. After that, an algorithm-pro作者: 流浪者 時(shí)間: 2025-3-29 22:50
Using Parallel Strategies to Speed up Pareto Local SearchPLS requires a long time to find high-quality solutions. In this paper, we propose and investigate several parallel strategies to speed up PLS. These strategies are based on a parallel multi-search framework. In our experiments, we investigate the performances of different parallel variants of PLS o作者: Choreography 時(shí)間: 2025-3-30 03:39
Differential Evolution Based Hyper-heuristic for the Flexible Job-Shop Scheduling Problem with Fuzzyy processing time (FJSPF). In the DEHH scheme, five simple and effective heuristic rules are designed to construct a set of low-level heuristics, and differential evolution is employed as the high-level strategy to manipulate the low-level heuristics to operate on the solution domain. Additionally, 作者: 小教堂 時(shí)間: 2025-3-30 04:47
ACO-iRBA: A Hybrid Approach to TSPN with Overlapping Neighborhoodsons Problem). In this paper, we propose a hybrid TSPN solution named ACO-iRBA in which the TSP and TPP tasks are tackled simultaneously by ACO (Ant Colony Optimization) and iRBA, an improved version of RBA (Rubber Band Algorithm), respectively. A major feature of ACO-iRBA is that it can properly han作者: MARS 時(shí)間: 2025-3-30 10:48 作者: 開始從未 時(shí)間: 2025-3-30 16:11
Exact Approaches for the Travelling Thief?Problemcy of such approaches is unknown due to their inability to find global optima. In this paper, we propose three exact algorithms and a hybrid approach to the TTP. We compare these with state-of-the-art approaches to gather a comprehensive overview on the accuracy of heuristic methods for solving smal作者: KEGEL 時(shí)間: 2025-3-30 19:51 作者: Adrenaline 時(shí)間: 2025-3-30 23:36
Multi-Factorial Evolutionary Algorithm Based on M2M Decompositionto decompose multi-objective optimization problems into multiple constrained sub-problems for enhancing the diversity of population and convergence of sub-regions. An machine learning model augmented version is also been implemented, which utilized discriminative models for pre-selecting solutions. 作者: intention 時(shí)間: 2025-3-31 03:04 作者: PTCA635 時(shí)間: 2025-3-31 07:40 作者: 傻瓜 時(shí)間: 2025-3-31 12:50
GP-Based Approach to Comprehensive Quality-Aware Automated Semantic Web Service Composition. It is an NP-hard problem due to its huge search space. Therefore, heuristics have to be employed to generate near-optimal solutions. Existing works employ Evolutionary Computation (EC) techniques to solve combinatorial optimisation problems in web service composition. In particular, Genetic Progra
