Paper Info
Title
ACO for Solving the Distributed Allocation of a Corporate Semantic Web
Abstract
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.
Year
DOI
Venue
2009
10.1007/978-3-642-05258-3_3
MICAI
Keywords
Field
DocType
ant colony optimization,corresponding instance,np problem,storage system,graph g,corporate semantic web,semantic index,common range,embedding g,information storage,distributed storage,semantic web,graph embedding,ant colony
Ant colony optimization algorithms,Ontology (information science),Embedding,Existential quantification,Computer science,Graph embedding,Distributed data store,Semantic Web,Theoretical computer science,P versus NP problem
Conference
Volume
ISSN
Citations 
5845
0302-9743
0
PageRank 
References 
Authors
0.34
9
3
Name
Order
Citations
PageRank
Ana B. Rios-Alvarado1286.51
Ricardo Marcelín-jiménez273.88
R. Carolina Medina-Ramírez311.50