Titlebook: Parallel Problem Solving from Nature – PPSN XVII; 17th International C Günter Rudolph,Anna V. Kononova,Tea Tu?ar Conference proceedings 202

非決定性

書目名稱Parallel Problem Solving from Nature – PPSN XVII影響因子(影響力)




書目名稱Parallel Problem Solving from Nature – PPSN XVII影響因子(影響力)學(xué)科排名




書目名稱Parallel Problem Solving from Nature – PPSN XVII網(wǎng)絡(luò)公開度




書目名稱Parallel Problem Solving from Nature – PPSN XVII網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Parallel Problem Solving from Nature – PPSN XVII被引頻次




書目名稱Parallel Problem Solving from Nature – PPSN XVII被引頻次學(xué)科排名




書目名稱Parallel Problem Solving from Nature – PPSN XVII年度引用




書目名稱Parallel Problem Solving from Nature – PPSN XVII年度引用學(xué)科排名




書目名稱Parallel Problem Solving from Nature – PPSN XVII讀者反饋




書目名稱Parallel Problem Solving from Nature – PPSN XVII讀者反饋學(xué)科排名

Nucleate

Gene-pool Optimal Mixing in?Cartesian Genetic Programmingls that re-use subexpressions more often than GP-GOMEA uses duplicate subexpressions. This indicates that CGP-GOMEA has unique added potential, allowing to find even smaller expressions than GP-GOMEA with similar accuracy.

種子

Genetic Programming for?Combining Directional Changes Indicators in?International Stock Marketsrmance to strategies derived under physical time, namely GP-PT, and also to a buy and hold trading strategy. Our results show that the GP-DC is able to outperform both GP-PT and the buy and hold strategy, making DC-based trading strategies a powerful complementary approach for algorithmic trading.

河流

OFF

Hybridizing Hypervolume-Based Evolutionary Algorithms and?Gradient Descent by?Dynamic Resource Allocationgorithms produce similar or better results than the EA or gradient-based algorithm alone, even when finite differences are used to approximate gradients. The implementation of the hybrid algorithm is available at ..

大漩渦

Importance-Aware Genetic Programming for?Automated Scheduling Heuristics Learning in?Dynamic Flexible Job Shop Schedulingthm can learn significantly better scheduling heuristics than the compared algorithms. The effectiveness of the proposed algorithm is realised by the proposed strategies for detecting rule importance and allocating resources. Particularly, the routing rules play a more important role than the sequencing rules in the examined DFJSS scenarios.

ANTH

A General Architecture for Generating Interactive Decomposition-Based MOEAs proposal to generate an interactive decomposition-based algorithm utilizing a reference vector re-arrangement procedure and MOEA/D. We demonstrate the performance of our proposal with a real-world problem and multiple benchmark problems.

legacy

懶洋洋

鎮(zhèn)痛劑