339 search results - page 26 / 68 » Handling dynamic data structures in search based testing |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
EUSFLAT
2003
13 years 10 months ago
2003
Recently, several algorithms have been proposed for using neural networks in dynamic analysis of small structural systems, and also constructing adaptive material modeling subrout...
SIGMOD
2003
ACM
14 years 9 months ago
2003
ACM
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML ...
CAMP
2005
IEEE
14 years 2 months ago
2005
IEEE
— For a peer-to-peer (P2P) system holding massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured...
SAC
2005
ACM
14 years 2 months ago
2005
ACM
This paper addresses single and multiple container loading problems. We propose to use dynamic prioritization to handle awkward box types. The box type with a higher priority will...