970 search results - page 129 / 194 » On encodings of spanning trees |
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Dynamic networks, e.g. Mobile Ad Hoc Networks (MANETs), call for adaptive protocols that can tolerate topological changes due to nodes’ mobility and depletion of battery power. ...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
ISCC
2002
IEEE
15 years 2 months ago
2002
IEEE
We study the performance of reliable and unreliable allnode broadcast over ad-hoc networks that use contentionbased channel access. To obtain analytical results while preserving h...
SSD
2001
Springer
15 years 2 months ago
2001
Springer
Intervals represent a fundamental data type for temporal, scientific, and spatial databases where time stamps and point data are extended to time spans and range data, respectively...
GLVLSI
2000
IEEE
15 years 2 months ago
2000
IEEE
We present a novel global routing and cross-point assignment methodology for sea-of-gates (SOG) designs. Using the proposed congestion driven spanning trees (CDST), and continuous...