359 search results - page 43 / 72 » Using graph analysis to study networks of adaptive agent |
MST
2010
13 years 2 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
DKE
2007
13 years 7 months ago
2007
Interaction protocols enable agents to communicate with each other effectively. Whereas several approaches exist to specify interaction protocols, none of them has design tools t...
TSP
2008
13 years 7 months ago
2008
This paper studies the behavior of the low-rank least mean squares (LMS) adaptive algorithm for the general case in which the input transformation may not capture the exact input s...
PG
2003
IEEE
14 years 29 days ago
2003
IEEE
We present a method for the adaptive reconstruction of a surface directly from an unorganized point cloud. The algorithm is based on an incrementally expanding Neural Network and ...
EDBT
2012
ACM
11 years 10 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...