Fast and Effective Classification using Parallel and Multi-start PSO

E-ISSN： 1938-7865|11|2|13-30

ISSN： 1938-7857

Source： Journal of Information Technology Research (JITR), Vol.11, Iss.2, 2018-04, pp. : 13-30

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Seeking global edges for traveling salesman problem in multi-start search

By Li Weiqi

Journal of Global Optimization, Vol. 51, Iss. 3, 2011-11 ,pp. : 515-540

Springer Publishing Company

Access to resources Recommend Favorite

An adaptive multi-start graph partitioning algorithm for structuring cellular networks

By Toril Matías

Journal of Heuristics, Vol. 17, Iss. 5, 2011-10 ,pp. : 615-635

Springer Publishing Company

Access to resources Recommend Favorite

Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem

International Journal of Swarm Intelligence Research (IJSIR), Vol. 2, Iss. 2, 2011-04 ,pp. : 52-70

IGI Global_journal

Access to resources Recommend Favorite

Independent Tasks Scheduling using Parallel PSO in Multiprocessor Systems

International Journal of Grid and High Performance Computing (IJGHPC), Vol. 7, Iss. 2, 2015-04 ,pp. : 1-17

IGI Global_journal

Access to resources Recommend Favorite

Parallel co-processor for PSO

By Rogé

International Journal of High Performance Systems Architecture, Vol. 3, Iss. 4, 2011-02 ,pp. : 233-240

Inderscience Publishers

Access to resources Recommend Favorite