180 search results - page 25 / 36 » Pruning the Search Space in Path-Based Test Generation |
SDM
2004
SIAM
14 years 11 months ago
2004
SIAM
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
DATAMINE
2006
14 years 9 months ago
2006
Existing algorithms for mining association patterns often rely on the support-based pruning strategy to prune a combinatorial search space. However, this strategy is not effective ...
91
Voted
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
AAAI
1994
14 years 11 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...