4131 search results - page 230 / 827 » Compactness in Topology and Computation |
188
click to vote
TON
2008
15 years 6 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
152
click to vote
GBRPR
2009
Springer
16 years 1 months ago
2009
Springer
The collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process....
171
click to vote
GLOBECOM
2007
IEEE
16 years 27 days ago
2007
IEEE
— With the advent of MPLS, the restoration times of communications is decreased down to 50 ms by the use of preconfigured backup LSPs. To ensure there are enough resources after ...
183
click to vote
AMC
2007
15 years 6 months ago
2007
In a distributed computing system (DCS), we need to allocate a number of modules to different processors for execution. It is desired to maximize the processor synergism in order...
140
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...