Evaluation of two heuristic approaches to solve the ontology meta-matching problem

ISSN： 0219-1377

Source： Knowledge and Information Systems, Vol.26, Iss.2, 2011-02, pp. : 225-247

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

Meta-Heuristic Algorithms to Solve Bi-Criteria Parallel Machines Scheduling Problem

International Journal of Applied Evolutionary Computation (IJAEC), Vol. 7, Iss. 2, 2016-04 ,pp. : 76-96

IGI Global_journal

Access to resources Recommend Favorite

An electromagnetic meta-heuristic for the nurse scheduling problem

By Maenhout Broos Vanhoucke Mario

Journal of Heuristics, Vol. 13, Iss. 4, 2007-08 ,pp. : 359-385

Springer Publishing Company

Access to resources Recommend Favorite

Using sticker to solve the 3-dimensional matching problem in molecular supercomputers

By Guo Minyi Chang Weng-Long Cao Jiannong

International Journal of High Performance Computing and Networking, Vol. 1, Iss. 1-2, 2005-08 ,pp. : 128-139

Inderscience Publishers

Access to resources Recommend Favorite

Meta-heuristic approaches for part selection and tool allocation in flexible manufacturing systems

By Arikan M. Erol S.

International Journal of Computer Integrated Manufacturing, Vol. 19, Iss. 4, 2006-06 ,pp. : 315-325

Taylor & Francis Ltd

Access to resources Recommend Favorite

Comparing meta-heuristic approaches for parallel machine scheduling problems

By Mendes A. S. Müller F. M. França P. M. Moscato P.

Production Planning and Control, Vol. 13, Iss. 2, 2002-03 ,pp. : 143-154

Taylor & Francis Ltd

Access to resources Recommend Favorite