2485 search results - page 229 / 497 » Time Bounded Frequency Computations |
188
click to vote
SAC
2006
ACM
16 years 16 days ago
2006
ACM
Parameterization is an effective technique for building flexible, reusable software. When dealing with parameterized components, an important concern is the time at which parame...
145
click to vote
FCT
1999
Springer
15 years 11 months ago
1999
Springer
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...
135
click to vote
PODC
1997
ACM
1997
ACM
Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness
15 years 10 months ago
We describe an ejjicient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds simdar to WFQ, along with throughput fairness. Our scheme can be im...
156
click to vote
INFOCOM
1993
IEEE
15 years 10 months ago
1993
IEEE
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...
149
click to vote
STACS
1991
Springer
15 years 10 months ago
1991
Springer
Bracket languages play an important role in the syntax analysis of programming languages. We investigate the parallel recognition and analysis of these languages as a first step ...