ACO for Solving the Distributed Allocation of a Corporate Semantic Web

Autor:	Ricardo Marcelín-Jiménez, R. Carolina Medina-Ramírez, Ana B. Rios-Alvarado
Rok vydání:	2009
Předmět:	Theoretical computer science Graph embedding Computer science Ant colony optimization algorithms Distributed data store P versus NP problem Embedding Graph (abstract data type) Ontology (information science) Semantic Web Graph
Zdroj:	MICAI 2009: Advances in Artificial Intelligence ISBN: 9783642052576 MICAI
DOI:	10.1007/978-3-642-05258-3_3
Popis:	This paper outlines a general method for allocating a document collection over a distributed storage system. Documents are organized to make up a corporate semantic web featured by a graph G 1 , each of whose nodes represents a set of documents having a common range of semantic indices. There exists a second graph G 2 modelling the distributed storage system. Our approach consists of embedding G 1 into G 2 , under size restrictions. We use a meta-heuristic called "Ant Colony Optimization", to solve the corresponding instances of the graph embedding problem, which is known to be a NP problem. Our solution provides an efficient mechanism for information storage and retrieval.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::f16cba572fe56c0fefd4ffbf1877692f https://doi.org/10.1007/978-3-642-05258-3_3