Titlebook: Recent Advances in Computational Optimization; Results of the Works Stefka Fidanova Book 2016 Springer International Publishing Switzerland

legerdemain

書目名稱Recent Advances in Computational Optimization影響因子(影響力)




書目名稱Recent Advances in Computational Optimization影響因子(影響力)學(xué)科排名




書目名稱Recent Advances in Computational Optimization網(wǎng)絡(luò)公開度




書目名稱Recent Advances in Computational Optimization網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Recent Advances in Computational Optimization被引頻次




書目名稱Recent Advances in Computational Optimization被引頻次學(xué)科排名




書目名稱Recent Advances in Computational Optimization年度引用




書目名稱Recent Advances in Computational Optimization年度引用學(xué)科排名




書目名稱Recent Advances in Computational Optimization讀者反饋




書目名稱Recent Advances in Computational Optimization讀者反饋學(xué)科排名

膽大

1860-949X ization, constraint programming and others.Constitutes a com.This volume is a comprehensive collection of extended contributions from the Workshop on Computational Optimization 2014, held at Warsaw, Poland, September 7-10, 2014. .The book presents recent advances in computational optimization. The v

虛度

水汽

用不完

Little

Synthesis of Self-Adaptive Supervisors of Multi-Task Real-Time Object-Oriented Systems Using DeveloT OOS). The procedure is based on developmental genetic programming. Early UML diagrams describing a MT RT OOS are used as input data to the procedure. Next, an artificial supervisor which optimizes the system use is automatically generated. The supervisor is self-adaptive what means that it is capa

Malaise

filicide

TATE

InterCriteria Analysis of ACO and GA Hybrid Algorithms,e apparatus of the index matrices and the intuitionistic fuzzy sets. The idea of InterCriteria Analysis is applied to establish the relations and dependencies of considered parameters based on different criteria referred to various metaheuristic algorithms. A hybrid scheme using Genetic Algorithm (G

難解

A Two-Stage Look-Ahead Heuristic for Packing Spheres into a Three-Dimensional Bin of Minimum Length variable length. The problem consists to pack all the spheres into the bin of minimum length. This problem is also known under the name of three-dimensional strip packing problem. The computational results conducted on a set of benchmark instances taken from the literature indicates that the propos