Sciweavers

1734 search results - page 117 / 347
» MSDR-D Network Localization Algorithm
Sort
View
IDA
2011
Springer
13 years 4 months ago
PSO driven collaborative clustering: A clustering algorithm for ubiquitous environments
Abstract. The goal of this article is to introduce a collaborative clustering approach to the domain of ubiquitous knowledge discovery. This clustering approach is suitable in peer...
Benoît Depaire, Rafael Falcón, Koen V...
ICAS
2006
IEEE
103views Robotics» more  ICAS 2006»
14 years 4 months ago
Model Driven capabilities of the DA-GRS model
— The development of applications that target dynamic networks often adresses the same difficulties. Since the underlying network topology is unstable, the application has to ha...
Arnaud Casteigts
AAAI
2006
13 years 11 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche
CCR
2008
88views more  CCR 2008»
13 years 10 months ago
Rethinking virtual network embedding: substrate support for path splitting and migration
Network virtualization is a powerful way to run multiple architectures or experiments simultaneously on a shared infrastructure. However, making efficient use of the underlying re...
Minlan Yu, Yung Yi, Jennifer Rexford, Mung Chiang
WAW
2010
Springer
306views Algorithms» more  WAW 2010»
13 years 8 months ago
Finding and Visualizing Graph Clusters Using PageRank Optimization
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
Fan Chung Graham, Alexander Tsiatas