2194 search results - page 4 / 439 » Improving HLRTA*( k ) |
DCG
2006
13 years 9 months ago
2006
We use circular sequences to give an improved lower bound on the minimum number of ( k)
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
SWAT
1990
Springer
14 years 1 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...
JAR
2000
13 years 9 months ago
2000
A lot of methods have been proposed -- and sometimes implemented -- for proof search in the propositional modal logics K, KT, and S4. It is difficult to compare the usefulness of ...
CPC
2008
13 years 10 months ago
2008
Suppose that n > (log k)ck , where c is a fixed positive constant. We prove that no matter how the edges of Kn are colored with k colors, there is a copy of K4 whose edges rece...