486 search results - page 70 / 98 » Improved upper bounds for 3-SAT |
68
Voted
ICNP
1996
IEEE
15 years 1 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...
STOC
1993
ACM
15 years 1 months ago
1993
ACM
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...
ISCA
1992
IEEE
15 years 1 months ago
1992
IEEE
As multiprocessor sizes scale and computer architects turn to interconnection networks with non-uniform communication latencies, the lure of exploiting communication locality to i...
EVOW
2010
Springer
15 years 1 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
83
Voted
CSL
2006
Springer
15 years 1 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...