339 search results - page 8 / 68 » Handling dynamic data structures in search based testing |
JEA
2008
13 years 7 months ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
ICDE
2005
IEEE
14 years 9 months ago
2005
IEEE
Order-based element labeling for tree-structured XML data is an important technique in XML processing. It lies at the core of many fundamental XML operations such as containment j...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
A hyper-heuristic performs search over a set of other search mechanisms. During the search, it does not require any problem-dependent data. This structure makes hyperheuristics pro...
TVLSI
2008
13 years 7 months ago
2008
We present a Mutation-based Validation Paradigm (MVP) technology that can handle complete high-level microprocessor implementations and is based on explicit design error modeling, ...
SIGSOFT
2003
ACM
14 years 8 months ago
2003
ACM
This paper presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or float variables. It extends our previous work to ...