128 search results - page 24 / 26 » Applying IC-Scheduling Theory to Familiar Classes of Computa... |
SIGCOMM
2012
ACM
11 years 9 months ago
2012
ACM
ACM Sigcomm 2006 published a paper [26] which was perceived to unify the deterministic and stochastic branches of the network calculus (abbreviated throughout as DNC and SNC) [39]...
CCR
2000
13 years 7 months ago
2000
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...
WOLLIC
2009
Springer
14 years 1 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
HYBRID
2010
Springer
14 years 2 months ago
2010
Springer
The complexity of physical and engineering systems, both in terms of the governing physical phenomena and the number of subprocesses involved, is mirrored in ever more complex mat...