Sciweavers

2956 search results - page 223 / 592
» Efficient Communication by Breathing
Sort
View
FLAIRS
2004
15 years 8 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
CORR
2010
Springer
185views Education» more  CORR 2010»
15 years 6 months ago
Acdmcp: An adaptive and completely distributed multi-hop clustering protocol for wireless sensor networks
Clustering is a very popular network structuring technique which mainly addresses the issue of scalability in large scale Wireless Sensor Networks. Additionally, it has been shown...
Khalid Nawaz, Alejandro P. Buchmann
IPPS
2007
IEEE
16 years 25 days ago
GridCopy: Moving Data Fast on the Grid
An important type of communication in grid and distributed computing environments is bulk data transfer. GridFTP has emerged as a de facto standard for secure, reliable, high-perf...
Rajkumar Kettimuthu, William E. Allcock, Lee Limin...
ICPP
1987
IEEE
15 years 10 months ago
Parallel Algorithm for Maximum Weight Matching in Trees
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
Shaunak Pawagi
TSP
2008
106views more  TSP 2008»
15 years 6 months ago
Identification of Matrices Having a Sparse Representation
We consider the problem of recovering a matrix from its action on a known vector in the setting where the matrix can be represented efficiently in a known matrix dictionary. Conne...
Götz E. Pfander, Holger Rauhut, Jared Tanner