1552 search results - page 43 / 311 » On the Complexity of Constant Propagation |
102
click to vote
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
— In [1], [2] it was noticed that sometimes it takes BGP a substantial amount of time and messages to converge and stabilize following the failure of some node in the Internet. I...
101
click to vote
ALT
2004
Springer
15 years 11 months ago
2004
Springer
Rademacher and Gaussian complexities are successfully used in learning theory for measuring the capacity of the class of functions to be learned. One of the most important propert...
107
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
112
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
135
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...