Sciweavers

2373 search results - page 249 / 475
» Complexities for generalized models of self-assembly
Sort
View
IPSN
2009
Springer
16 years 1 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
16 years 17 days ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
PPOPP
2005
ACM
16 years 5 days ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
ATAL
2005
Springer
16 years 5 days ago
Towards a theory of "local to global" in distributed multi-agent systems (II)
a growing need to study abstract problems in distributed multi-agent systems in a systematic way, as well as to provide a qualitative mathematical framework in which to compare po...
Daniel Yamins
EUROSEC
2010
ACM
15 years 12 months ago
Managing intrusion detection rule sets
The prevalent use of the signature-based approach in modern intrusion detection systems (IDS) emphasizes the importance of the efficient management of the employed signature sets....
Natalia Stakhanova, Ali A. Ghorbani