169 search results - page 5 / 34 » Layered Working-Set Trees |
TAMC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
AINA
2006
IEEE
14 years 1 months ago
2006
IEEE
Efficient service discovery in dynamic, crossorganizational VO is one of the challenge aspects in ChinaGrid. Network overlay and search algorithms are two important considerations...
EUC
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Well-scheduled communications, in conjunction with the aggregation of data reduce the energy waste on idle listening and redundant transmissions. In addition, the adjusta...
ISPDC
2010
IEEE
13 years 5 months ago
2010
IEEE
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into c...
JUCS
2007
13 years 7 months ago
2007
: In the IEEE 802.1D standard for the Media Access Control layer (MAC layer) bridges, there is an STP (Spanning Tree Protocol) definition, based on the algorithm that was proposed...