2194 search results - page 228 / 439 » Improving HLRTA*( k ) |
102
click to vote
ISAAC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
118
click to vote
SAT
2009
Springer
15 years 8 months ago
2009
Springer
We introduce Cardinality Networks, a new CNF encoding of cardinality constraints. It improves upon the previously existing encodings such as the sorting networks of [ES06] in that ...
106
click to vote
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
: In this paper, we have proposed a time efficient, energy saving and robust broadcast/multicast protocol for reconfigurable cluster-based sensor network. In our broadcast protocol...
109
click to vote
ASIACRYPT
2007
Springer
15 years 7 months ago
2007
Springer
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bit...
CPM
2007
Springer
15 years 7 months ago
2007
Springer
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...