Sciweavers

2526 search results - page 193 / 506
» A Comparative Evaluation of Name-Matching Algorithms
Sort
View
EDBTW
2004
Springer
14 years 3 months ago
SPROUT: P2P Routing with Social Networks
In this paper, we investigate how existing social networks can benefit P2P data networks by leveraging the inherent trust associated with social links. We present a trust model t...
Sergio Marti, Prasanna Ganesan, Hector Garcia-Moli...
CEC
2003
IEEE
14 years 2 months ago
Digital circuit design through simulated evolution (SimE)
In this paper, the use of Simulated Evolution (SimE) Algorithm in the design of digital logic circuits is proposed. SimE algorithm consists of three steps: evaluation, selection an...
Sadiq M. Sait, Mostafa Abd-El-Barr, Uthman S. Al-S...
PAAMS
2010
Springer
14 years 2 months ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier
CCGRID
2008
IEEE
13 years 11 months ago
Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
Sascha Hunold, Thomas Rauber, Frédér...
ECIR
2010
Springer
13 years 11 months ago
Text Clustering for Peer-to-Peer Networks with Probabilistic Guarantees
Text clustering is an established technique for improving quality in information retrieval, for both centralized and distributed environments. However, for highly distributed envir...
Odysseas Papapetrou, Wolf Siberski, Norbert Fuhr