Sciweavers

4781 search results - page 700 / 957
» Online algorithms for network design
Sort
View
AMC
2005
117views more  AMC 2005»
15 years 6 months ago
Teleonomic entropy: measuring the phase-space of end-directed systems
We introduce a novel way of measuring the entropy of a set of values undergoing changes. Such a measure becomes useful when analyzing the temporal development of an algorithm desi...
Alexander Pudmenzky
TON
2010
126views more  TON 2010»
15 years 1 months ago
MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
TPDS
2010
164views more  TPDS 2010»
15 years 1 months ago
Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation
The basic operation in such a network is the systematic gathering (with or without in-network aggregation) and transmitting of sensed data to a base station for further processing....
Yanwei Wu, Xiang-Yang Li, Yunhao Liu, Wei Lou
CN
2011
94views more  CN 2011»
15 years 1 months ago
Modeling the interactions of congestion control and switch scheduling
—In this paper, we study the interactions of user-based congestion control algorithms and router-based switch scheduling algorithms. We show that switch scheduling algorithms tha...
Alexander Shpiner, Isaac Keslassy
ANCS
2005
ACM
16 years 4 days ago
Fast and scalable pattern matching for content filtering
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packe...
Sarang Dharmapurikar, John W. Lockwood