2095 search results - page 203 / 419 » Improved pebbling bounds |
190
click to vote
CSR
2010
Springer
15 years 11 months ago
2010
Springer
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
175
click to vote
LSSC
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we analyze a quasi-Monte Carlo method for solving systems of linear algebraic equations. It is well known that the convergence of Monte Carlo methods for numerical in...
187
click to vote
QOFIS
2001
Springer
15 years 11 months ago
2001
Springer
FEC mechanisms have been proposed to recover from packet losses, and hence to improve the perceived quality in audio applications. Recently, it has been shown in [1] that the redun...
166
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
132
click to vote
SWAT
1990
Springer
15 years 10 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...