3055 search results - page 399 / 611 » Randomized Search Trees |
141
click to vote
ADBIS
2007
Springer
15 years 10 months ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
132
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
119
click to vote
CPAIOR
2005
Springer
15 years 9 months ago
2005
Springer
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
112
click to vote
SC
2003
ACM
15 years 9 months ago
2003
ACM
We present a novel approach for decomposing contact/impact computations in which the mesh elements come in contact with each other during the course of the simulation. Effective d...
159
Voted
SIGMETRICS
2003
ACM
15 years 9 months ago
2003
ACM
In main-memory databases, the number of processor cache misses has a critical impact on the performance of the system. Cacheconscious indices are designed to improve performance b...