2374 search results - page 164 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
107
Voted
CEC
2008
IEEE
2008
IEEE
Decentralised distributed multiple objective particle swarm optimisation using peer to peer networks
15 years 9 months ago
—This paper describes a distributed particle swarm optimisation algorithm (PSO) based on peer-to-peer computer networks. A number of modifications are made to the more tradition...
262
click to vote
SDM
2011
SIAM
14 years 5 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
126
click to vote
CSDA
2008
15 years 2 months ago
2008
It is shown that any pair of scatter and spatial scatter matrices yields an estimator of the separating matrix for complex-valued independent component analysis (ICA). Scatter (re...
142
Voted
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
The Distributed Constraint Optimization Problem (DCOP) is a fundamental formalism for multi-agent cooperation. A dedicated framework called Resource Constrained DCOP (RCDCOP) has ...
116
Voted
ICN
2005
Springer
15 years 8 months ago
2005
Springer
The major concept of the Multi-Protocol Label Switching (MPLS) network uses the Label Switch Path (LSP) technique that provides high performance in packet delivery without routing ...