Sciweavers

1302 search results - page 96 / 261
» On the Strong Chromatic Number
Sort
View
STOC
2007
ACM
132views Algorithms» more  STOC 2007»
16 years 6 months ago
On the convergence of Newton's method for monotone systems of polynomial equations
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
Stefan Kiefer, Michael Luttenberger, Javier Esparz...
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
16 years 6 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
ICPADS
2008
IEEE
16 years 27 days ago
Integrity-Preserving Replica Coordination for Byzantine Fault Tolerant Systems
The use of good random numbers is essential to the integrity of many mission-critical systems. However, when such systems are replicated for Byzantine fault tolerance, a serious i...
Wenbing Zhao
ICDCSW
2007
IEEE
16 years 23 days ago
Exploiting Gossip for Self-Management in Scalable Event Notification Systems
1 Challenges of scale have limited the development of event notification systems with strong properties, despite the urgent demand for consistency, reliability, security, and other...
Ken Birman, Anne-Marie Kermarrec, Krzysztof Ostrow...
HPCC
2007
Springer
16 years 18 days ago
Towards Scalable Event Tracing for High End Systems
Although event tracing of parallel applications offers highly detailed performance information, tracing on current leading edge systems may lead to unacceptable perturbation of the...
Kathryn Mohror, Karen L. Karavanic