1552 search results - page 58 / 311 » On the Complexity of Constant Propagation |
167
click to vote
ANCS
2005
ACM
15 years 12 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 ...
188
click to vote
FOCS
2007
IEEE
16 years 19 days ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
213
click to vote
SIAMCOMP
2010
15 years 4 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
172
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
155
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....