539 search results - page 80 / 108 » An Improved Upper Bound for SAT |
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
ICNP
1996
IEEE
13 years 12 months ago
1996
IEEE
Abstract-- We present a scheduling protocol, called TimeShift Scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a p...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
TON
1998
13 years 7 months ago
1998
—We present a scheduling protocol, called time-shift scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a predet...
SOSP
2001
ACM
14 years 4 months ago
2001
ACM
As raw system and network performance continues to improve at exponential rates, the utility of many services is increasingly limited by availability rather than performance. A ke...