970 search results - page 147 / 194 » On encodings of spanning trees |
PADS
2003
ACM
14 years 4 months ago
2003
ACM
In simulating large-scale networks, due to the limitation of available resources on computers, the size of the networks and the scale of simulation scenarios are often restricted....
FSTTCS
2003
Springer
14 years 4 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
ICSM
2002
IEEE
14 years 4 months ago
2002
IEEE
When a software system critical for an organization exhibits a problem during its operation, it is relevant to fix it in a short period of time, to avoid serious economical losse...
INFOCOM
2002
IEEE
14 years 4 months ago
2002
IEEE
Abstract— Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In...
IPPS
2002
IEEE
14 years 4 months ago
2002
IEEE
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...