339 search results - page 9 / 68 » Handling dynamic data structures in search based testing |
SCCC
2003
IEEE
14 years 1 months ago
2003
IEEE
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
DBISP2P
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper addresses the problem of data placement, indexing, and querying large XML data repositories distributed over an existing P2P service infrastructure. Our archit...
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Biobanks are gaining in importance by storing large collections of patient's clinical data (e.g. disease history, laboratory parameters, diagnosis, life style) toget...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
DSD
2005
IEEE
14 years 1 months ago
2005
IEEE
The increasing amount of test data needed to test SOC (System-on-Chip) entails efficient design of the TAM (test access mechanism), which is used to transport test data inside the...