1461 search results - page 175 / 293 » The Cost of Cache-Oblivious Searching |
130
click to vote
IJCAI
2001
15 years 7 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
167
click to vote
ECIS
2003
15 years 7 months ago
2003
Due to the extensive development und use of information technology, a lot of companies gained access to vast internal and external information sources. Yet nonetheless, efficiency...
188
click to vote
IJCAI
2001
15 years 7 months ago
2001
This paper presents an efficient online mode estimation algorithm for a class of sensor-rich, distributed embedded systems, the so-called hybrid systems. A central problem in dist...
188
click to vote
IC
2003
15 years 7 months ago
2003
Magic Square is a ppeer-to-peer protocol for searching resources. The recovery cost of Magic Square is high and the system doesn’t recover the failure in simultaneous neighbor n...
189
click to vote
SEBD
1997
15 years 7 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...