Titlebook: Computer and Information Sciences; 31st International S Tadeusz Czachórski,Erol Gelenbe,Ricardo Lent Conference proceedings‘‘‘‘‘‘‘‘ 2016 Th

憑票入場(chǎng)

書(shū)目名稱Computer and Information Sciences影響因子(影響力)




書(shū)目名稱Computer and Information Sciences影響因子(影響力)學(xué)科排名




書(shū)目名稱Computer and Information Sciences網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Computer and Information Sciences網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Computer and Information Sciences被引頻次




書(shū)目名稱Computer and Information Sciences被引頻次學(xué)科排名




書(shū)目名稱Computer and Information Sciences年度引用




書(shū)目名稱Computer and Information Sciences年度引用學(xué)科排名




書(shū)目名稱Computer and Information Sciences讀者反饋




書(shū)目名稱Computer and Information Sciences讀者反饋學(xué)科排名

外星人

Brandon P. Brown,Jason T. Eberl Ph.D, it is often a time-consuming task and needs to be performed under a restricted computational budget. In this study, the results from our previous work on using the Taguchi method to tune the parameters of a memetic algorithm for cross-domain search are further analysed and extended. Although the T

慢慢沖刷

Brandon P. Brown,Jason T. Eberl Ph.Dnce is a crucial component of selection hyper-heuristics, deciding whether to accept or reject a new solution at each step during the search process. This study investigates group decision making strategies as ensemble methods exploiting the strengths of multiple move acceptance methods for improved

Fallibility

myopia

Compassionate

Compassionate

使成波狀

Culmination

The Ethics of Information Warfareand evaluation based on specially created test datasets. Sometimes preparation of test sets can be troublesome. Another problem appears when discretization of input sets is taken into account. It is not obvious how to discretize test datasets. Therefore model evaluation method not requiring test set

VALID

Luciano Floridi,Mariarosaria Taddeolity issues mainly due to the evaluation of large search spaces. Evaluation of the search space cosists translating candidate concept descriptor into SQL queries, which involve a number of equijoins on several tables, and running them against the dataset. We aim to improve time efficiency of such sy