3874 search results - page 149 / 775 » Approximation Algorithms for k-hurdle Problems |
134
click to vote
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
143
click to vote
FSTTCS
2001
Springer
15 years 6 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
113
Voted
AAAI
2007
15 years 4 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
124
click to vote
AAECC
2006
Springer
15 years 1 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
AMC
2005
15 years 1 months ago
2005
In this paper, by using the theories and methods of mathematical analysis and computer algebra, a reliable algorithm of reduction of order approximation method for solving singula...