標(biāo)題: Titlebook: Applications of Evolutionary Computation; 20th European Confer Giovanni Squillero,Kevin Sim Conference proceedings 2017 Springer Internatio [打印本頁] 作者: JADE 時(shí)間: 2025-3-21 17:30
書目名稱Applications of Evolutionary Computation影響因子(影響力)
書目名稱Applications of Evolutionary Computation影響因子(影響力)學(xué)科排名
書目名稱Applications of Evolutionary Computation網(wǎng)絡(luò)公開度
書目名稱Applications of Evolutionary Computation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Applications of Evolutionary Computation被引頻次
書目名稱Applications of Evolutionary Computation被引頻次學(xué)科排名
書目名稱Applications of Evolutionary Computation年度引用
書目名稱Applications of Evolutionary Computation年度引用學(xué)科排名
書目名稱Applications of Evolutionary Computation讀者反饋
書目名稱Applications of Evolutionary Computation讀者反饋學(xué)科排名
作者: eulogize 時(shí)間: 2025-3-21 21:29 作者: neutralize 時(shí)間: 2025-3-22 01:05 作者: annexation 時(shí)間: 2025-3-22 06:59 作者: monogamy 時(shí)間: 2025-3-22 09:14
Solving Dynamic Graph Coloring Problem Using Dynamic Pool Based Evolutionary Algorithm our algorithm with a well known heuristic for solving the graph coloring problem and a genetic algorithm with a dynamic population using a large number of dynamic graphs. The experimental evaluation indicates that our algorithm outperforms these algorithms with respect to number of colors used by t作者: 聚集 時(shí)間: 2025-3-22 13:47 作者: CHOKE 時(shí)間: 2025-3-22 20:49
0302-9743 and pattern recognition), EvoINDUSTRY (nature-inspired techniques in industrial settings), EvoKNOW (knowledge incorporation in evolutionary computation), EvoNUM (bio-inspired algorithms for con978-3-319-55791-5978-3-319-55792-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Cupidity 時(shí)間: 2025-3-22 21:24 作者: Efflorescent 時(shí)間: 2025-3-23 02:27
Sabrina De Capitani di Vimercatin that access to the source code is not available and testing is only possible via the GUI. Even at this preliminary stage, the analysis shows the potential of GP to evolve action selection mechanisms.作者: CHIP 時(shí)間: 2025-3-23 08:04 作者: ILEUM 時(shí)間: 2025-3-23 10:30
Active and Real-Time Data Warehousing our algorithm with a well known heuristic for solving the graph coloring problem and a genetic algorithm with a dynamic population using a large number of dynamic graphs. The experimental evaluation indicates that our algorithm outperforms these algorithms with respect to number of colors used by t作者: MARS 時(shí)間: 2025-3-23 13:55
R. Schulz‐Wendtland,K. Anders,W. Bautzwidespread use of the PDOA method. To compare algorithms two different metrics were proposed: average distance miss and median distance miss, giving insight into the algorithms’ performance. Finally, the use of an adaptive mutation step proved important.作者: SNEER 時(shí)間: 2025-3-23 19:53 作者: malapropism 時(shí)間: 2025-3-24 00:49 作者: deforestation 時(shí)間: 2025-3-24 03:43
An Online Packing Heuristic for the Three-Dimensional Container Loading Problem in Dynamic Environme Internet. The effectiveness of the online packing heuristic is evaluated on a set of generated data. The experimental results show that the algorithm could solve the 3D container loading problems in online fashion and is competitive against other algorithms both in the terms of running time, space utilization and the number of bins.作者: 無目標(biāo) 時(shí)間: 2025-3-24 06:33
Henk C. A. van Tilborg,Sushil Jajodiaion procedure for existing code. We give a tutorial example of the specific polytypic approach we adopt and compare both runtime efficiency and required lines of code against the well-known EpochX GP framework, showing comparable performance in the former and the complete elimination of boilerplate for the latter.作者: infelicitous 時(shí)間: 2025-3-24 13:29
Reference work Oct 20051st editionrobust solution. The main goal of the proposed algorithm is to maximize the average number of environments during which the selected solutions’ quality remains acceptable. The experimental results show that our proposed algorithm can perform significantly better than existing work in this aspect.作者: 想象 時(shí)間: 2025-3-24 15:36 作者: 掃興 時(shí)間: 2025-3-24 22:35 作者: Antioxidant 時(shí)間: 2025-3-25 00:13
Sabrina De Capitani di Vimercati Prof.putation algorithm to optimise the concurrent implementation of three widely-used divide-and-conquer algorithms within the Akka toolkit: Quicksort, Strassen’s matrix multiplication, and the Fast Fourier Transform.作者: falsehood 時(shí)間: 2025-3-25 04:19
Active and Real-Time Data Warehousing Internet. The effectiveness of the online packing heuristic is evaluated on a set of generated data. The experimental results show that the algorithm could solve the 3D container loading problems in online fashion and is competitive against other algorithms both in the terms of running time, space utilization and the number of bins.作者: ABOUT 時(shí)間: 2025-3-25 09:05 作者: 無政府主義者 時(shí)間: 2025-3-25 14:47 作者: textile 時(shí)間: 2025-3-25 19:14 作者: 辯論 時(shí)間: 2025-3-25 23:48
Focusing Learning-Based Testing Away from Known Weaknessesa weakness and uses this similarity to penalize new tests. We instantiated this idea to the testing of ad-hoc wireless networks using the IACL approach, more precisely to applications in precision agriculture, and our experiments show that our modification results in finding substantially different tests from the test(s) that we want to avoid.作者: 誘騙 時(shí)間: 2025-3-26 00:22
Pre-scheduled Colony Size Variation in Dynamic Environmentsbehaviour of the algorithm between the early and later stages of the optimization process. A smaller colony size leads to better performance on shorter runs whereas a larger colony size leads to better performance on longer runs. In this paper, pre-scheduling of varying the colony size of .AS is investigated in dynamic environments.作者: 自負(fù)的人 時(shí)間: 2025-3-26 06:05
Adaptive Chosen Plaintext Attacktrics composing the rules. The evaluation of our work on 9 JavaScript web projects has shown promising results in terms of detection precision of 92% and recall of 85%, with no threshold tuning required.作者: Ambulatory 時(shí)間: 2025-3-26 08:53
Active and Real-Time Data Warehousingoutline to which extent these methods are able to anticipate forthcoming dynamic change events by evaluating historical records of previous changes and other optimization knowledge managed by the IMDB.作者: patriarch 時(shí)間: 2025-3-26 15:27 作者: 確定的事 時(shí)間: 2025-3-26 18:13
Encyclopedia of Diagnostic Imagingenetic algorithm determines parameter values and sets the flow control for the classification algorithm. The proposed system is tested on real world problems and the results indicate that induced classifiers perform better than manually designed classifiers.作者: 舉止粗野的人 時(shí)間: 2025-3-26 21:09
On the Use of Smelly Examples to Detect Code Smells in JavaScripttrics composing the rules. The evaluation of our work on 9 JavaScript web projects has shown promising results in terms of detection precision of 92% and recall of 85%, with no threshold tuning required.作者: 借喻 時(shí)間: 2025-3-27 04:54 作者: 假裝是你 時(shí)間: 2025-3-27 08:08 作者: Rankle 時(shí)間: 2025-3-27 10:54 作者: maladorit 時(shí)間: 2025-3-27 17:17
Adaptive Chosen Ciphertext Attackigh due to the combinatorial explosion of features. For this reason, some coverage criteria have been proposed which try to test at least all feature interactions without the necessity to test all products, e.g., all pairs of features (pairwise coverage). In addition, it is desirable to first test p作者: 自制 時(shí)間: 2025-3-27 20:52 作者: 全能 時(shí)間: 2025-3-27 22:30 作者: Supplement 時(shí)間: 2025-3-28 03:43
https://doi.org/10.1007/978-1-4419-5906-5wn weaknesses. Our approach adds to the normally used fitness measure a component that computes the similarity of a test to known tests that revealed a weakness and uses this similarity to penalize new tests. We instantiated this idea to the testing of ad-hoc wireless networks using the IACL approac作者: monogamy 時(shí)間: 2025-3-28 06:23
Henk C. A. van Tilborg,Sushil Jajodiahe majority of existing approaches are not type-safe: i.e. they can fail at runtime because the search mechanisms lack the strict type information often available to the compiler. In this article, we describe ., a Scala framework that uses ., a relatively recent advance in program abstraction. . req作者: 捏造 時(shí)間: 2025-3-28 13:51 作者: 最有利 時(shí)間: 2025-3-28 18:18
Reference work Oct 20051st editiong optimum efficiently. However, continuously tracking a moving optimum is not practical in many real-world problems because changing solutions frequently is not possible or very costly. Recently, another practical way to tackle DOPs has been suggested: robust optimization over time (ROOT). In ROOT, 作者: 迎合 時(shí)間: 2025-3-28 21:33
Encyclopedia of Database Systemsicular, customer data may not be known with certainty. Before the beginning of the day, probability distributions on customer data are used to compute a first-stage solution that optimizes an expected cost. Customer data are revealed online, while the solution is executed, and a recourse strategy is作者: jaunty 時(shí)間: 2025-3-28 23:53
Active and Real-Time Data Warehousinge may waste computational resources whereas a small colony size may restrict the searching capabilities of the algorithm. There is a trade off in the behaviour of the algorithm between the early and later stages of the optimization process. A smaller colony size leads to better performance on shorte作者: figment 時(shí)間: 2025-3-29 05:18
Active and Real-Time Data Warehousingnsional bin packing problem in the online case where items are not known well in advance and they have to be packed in real-time when they arrive. This is relevant in many real-world scenarios such as automated cargo loading in warehouses. This is also relevant in the new logistics model of Physical作者: 不滿分子 時(shí)間: 2025-3-29 08:37
Active and Real-Time Data Warehousing database (IMDB) technology to expedite the search process subject to change events arising at runtime. The implemented system benefits from optimization knowledge persisted on an IMDB serving as associative memory to better guide the optimizer through changing environments. For this, specific strat作者: flaunt 時(shí)間: 2025-3-29 14:41 作者: Liability 時(shí)間: 2025-3-29 17:35 作者: laceration 時(shí)間: 2025-3-29 20:10
R. Schulz‐Wendtland,K. Anders,W. Bautzal (PDOA) technique a prominent choice. Predicting the location of an unknown RF emitter can be seen as a continuous optimization problem, minimizing the error w.r.t. the sensor measurements gathered. Most instances of this problem feature multi-modality, making these challenging to solve. This pape作者: Immunization 時(shí)間: 2025-3-30 03:28
Encyclopedia of Diagnostic Imagingman expert, providing out of the box software that can be used by novices. In this study the automated design of genetic programming classification algorithms is proposed. A number of design decisions have to be considered by algorithm designers during the design process and this is usually a time c作者: 流動(dòng)性 時(shí)間: 2025-3-30 06:04 作者: 小口啜飲 時(shí)間: 2025-3-30 10:16 作者: maverick 時(shí)間: 2025-3-30 13:17
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/159391.jpg作者: OCTO 時(shí)間: 2025-3-30 19:24 作者: Radiation 時(shí)間: 2025-3-30 22:26
978-3-319-55791-5Springer International Publishing AG 2017作者: 吞噬 時(shí)間: 2025-3-31 03:09
Hybrid Algorithms Based on Integer Programming for the Search of Prioritized Test Data in Software Pigh due to the combinatorial explosion of features. For this reason, some coverage criteria have been proposed which try to test at least all feature interactions without the necessity to test all products, e.g., all pairs of features (pairwise coverage). In addition, it is desirable to first test p作者: 新手 時(shí)間: 2025-3-31 06:26
On the Use of Smelly Examples to Detect Code Smells in JavaScriptll. Recent studies have produced a set of manually defined rules to identify these defects. We propose, in this work, the automation of deriving these rules to ensure scalability and potentially the detection of a wider set of defects without requiring any extensive knowledge on rules tuning. To thi作者: 雄辯 時(shí)間: 2025-3-31 12:41 作者: Devastate 時(shí)間: 2025-3-31 14:13 作者: onlooker 時(shí)間: 2025-3-31 19:38
