Sciweavers

1469 search results - page 220 / 294
» Characterizing the Structural Complexity of Real-World Compl...
Sort
View
127
Voted
ATAL
2010
Springer
15 years 4 months ago
Using graph analysis to study networks of adaptive agent
Experimental analysis of networks of cooperative learning agents (to verify certain properties such as the system's stability) has been commonly used due to the complexity of...
Sherief Abdallah
121
Voted
EUROSYS
2007
ACM
16 years 14 days ago
Macroprogramming heterogeneous sensor networks using cosmos
In this paper, we present COSMOS, a novel architecture for macroprogramming heterogeneous sensor network systems. Macroprogramming entails aggregate system behavior specification...
Asad Awan, Suresh Jagannathan, Ananth Grama
PR
2006
78views more  PR 2006»
15 years 3 months ago
Similarity-based analysis for large networks of ultra-low resolution sensors
By analyzing the similarities between bit streams coming from a network of motion detectors, we can recover the network geometry and discover structure in the human behavior being...
Christopher Richard Wren, David C. Minnen, Sriniva...
ISPASS
2006
IEEE
15 years 9 months ago
Modeling TCAM power for next generation network devices
Applications in Computer Networks often require high throughput access to large data structures for lookup and classification. Many advanced algorithms exist to speed these searc...
Banit Agrawal, Timothy Sherwood
168
Voted
MST
2010
187views more  MST 2010»
14 years 10 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda