Biological-inspired algorithms for dynamic search in web graphs
We propose a biological-inspired algorithmic procedure for improving the precision level in respect to a web user's query. This algorithm is capable of tracing relevant information in web graphs, imitating the mission of foraging ants. Our proposal is an Ant Colony Optimization (ACO) modification, however its differentiation lies in the fact that no predefined graph is employed, since the search graph is dynamically constructed during the algorithm execution. Despite some weaknesses in terms of time execution, it was evaluated that the effectiveness of the algorithm was quite satisfying in large web graph sets. © 2011 IEEE.
Showing items related by title, author, creator and subject.
Joint QoS multicast power / admission control and base station assignment: A geometric programming approach Karipidis, E.; Sidiropoulos, N. D.; Tassiulas, L. (2008)The joint power control and base station (BS) assignment problem is considered under Quality-of-Service (QoS) constraints. If a feasible solution exists, the problem can be efficiently solved using existing distributed ...
Markou, E.; Paquette, M. (2012)We consider the problem of locating a black hole in a synchronous, anonymous, and unoriented torus network using mobile agents. A black hole is a harmful network node that destroys any agent visiting it without leaving any ...
Dobrev, S.; Královič, R.; Markou, E. (2012)We study the problem of exploring an unknown undirected graph with non-negative edge weights. Starting at a distinguished initial vertex s, an agent must visit every vertex of the graph and return to s. Upon visiting a ...