Sciweavers

7133 search results - page 1121 / 1427
» Communication algorithms with advice
Sort
View
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
16 years 29 days ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
IWLCS
2005
Springer
16 years 29 days ago
Counter Example for Q-Bucket-Brigade Under Prediction Problem
Aiming to clarify the convergence or divergence conditions for Learning Classifier System (LCS), this paper explores: (1) an extreme condition where the reinforcement process of ...
Atsushi Wada, Keiki Takadama, Katsunori Shimohara
218
Voted
MOBICOM
2004
ACM
16 years 26 days ago
Localization for mobile sensor networks
Many sensor network applications require location awareness, but it is often too expensive to include a GPS receiver in a sensor network node. Hence, localization schemes for sens...
Lingxuan Hu, David Evans
TACAS
2004
Springer
122views Algorithms» more  TACAS 2004»
16 years 24 days ago
A Scalable Incomplete Test for the Boundedness of UML RT Models
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
Stefan Leue, Richard Mayr, Wei Wei
INFOCOM
2003
IEEE
16 years 22 days ago
Exploring the trade-off between label size and stack depth in MPLS Routing
— Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineer...
Anupam Gupta, Amit Kumar, Rajeev Rastogi
« Prev « First page 1121 / 1427 Last » Next »