ACO for Solving the Distributed Allocation of a Corporate Semantic Web

Authors:
Ana B. Rios-Alvarado;Ricardo Marcelín-Jiménez;R. Carolina Medina-Ramírez
Affiliations:
Department of Electrical Engineering, Universidad Autónoma Metropolitana - Iztapalapa, Atlixco, México 186;Department of Electrical Engineering, Universidad Autónoma Metropolitana - Iztapalapa, Atlixco, México 186;Department of Electrical Engineering, Universidad Autónoma Metropolitana - Iztapalapa, Atlixco, México 186
Venue:
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Year:
2009

Citing 8
Cited 0

Yet another distributed depth-first-search algorithm

Information Processing Letters
On Embedding Rectangular Grids in Hypercubes

IEEE Transactions on Computers
A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface

SIAM Journal on Discrete Mathematics
OceanStore: an architecture for global-scale persistent storage

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
The Evolving Field of Distributed Storage

IEEE Internet Computing
Mob --- A Parallel Heuristic for Graph-Embedding

Mob --- A Parallel Heuristic for Graph-Embedding
GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information

Proceedings of the 1st international conference on Embedded networked sensor systems
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid

Theory of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

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.