740 search results - page 71 / 148 » Lower bounds for Buchsbaum* complexes |
160
click to vote
ANCS
2005
ACM
15 years 11 months ago
2005
ACM
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
150
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
152
click to vote
ISAAC
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
172
click to vote
RTAS
2005
IEEE
15 years 11 months ago
2005
IEEE
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
160
click to vote
ALT
2006
Springer
16 years 3 months ago
2006
Springer
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...