727 search results - page 143 / 146 » A Calculus of Bounded Capacities |
121
click to vote
FOSSACS
2001
Springer
15 years 2 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
IWQOS
2001
Springer
15 years 2 months ago
2001
Springer
— Efficient network provisioning mechanisms that support service differentiation and automatic capacity dimensioning are essential to the realization of the Differentiated Servi...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
ICNP
1996
IEEE
15 years 1 months ago
1996
IEEE
Recent measurements of local-area and wide-area traffic have shown that network traffic exhibits variability at a wide range of scales. In this paper, we examine a mechanism that ...
ISTCS
1997
Springer
15 years 1 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...