2194 search results - page 24 / 439 » Improving HLRTA*( k ) |
106
Voted
LISP
2007
15 years 17 days ago
2007
Krivine presents the K machine, which produces weak head normal form results. Sestoft introduces several call-by-need variants of the K machine that implement result sharing via pu...
WDAG
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...
129
Voted
BMCBI
2008
15 years 24 days ago
2008
Background: Illumina Infinium whole genome genotyping (WGG) arrays are increasingly being applied in cancer genomics to study gene copy number alterations and allele-specific aber...
82
Voted
MFCS
1993
Springer
15 years 4 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
97
Voted
COMBINATORICS
2007
15 years 21 days ago
2007
Let k3(n) denote the minimal cardinality of a ternary code of length n and covering radius one. In this paper we show k3(7) ≥ 156 and k3(8) ≥ 402 improving on the best previou...