• Korat

  • Referenced in 33 articles [sw07259]
  • Korat is a technique for automatic test case generation: given a predicate and a bound ... pruning large portions of the search space.This paper illustrates the use of Korat for testing...
  • MULKNAP

  • Referenced in 37 articles [sw06467]
  • greedy heuristic, we apply the pegging test to reduce the problem size. Next ... Lagrangian multipliers obtained above for pruning subproblems, and at each terminal subproblem, we solve ... Thus, we were able to solve test problems with up to 160,000 items...
  • Symstra

  • Referenced in 19 articles [sw01296]
  • methods from the class under test and a bound on the length of sequences, Symstra ... object-state space of the class and prunes this exploration based on the state comparisons ... Experimental results show that Symstra generates unit tests that achieve higher branch coverage faster than...
  • MaLARea

  • Referenced in 48 articles [sw10278]
  • successful proofs, using the learned information to prune the set of available axioms ... first version of MaLARea has been tested on the more difficult (chainy) division...
  • BIDE

  • Referenced in 36 articles [sw39999]
  • algorithms work under the candidate maintenance-and-test paradigm which is inherently costly in both ... closure checking scheme called bidirectional extension, and prunes the search space more deeply compared...
  • fCube

  • Referenced in 8 articles [sw11383]
  • prune the search space acting on different aspects of proof-search. We tested the efficiency...
  • UCI++

  • Referenced in 3 articles [sw23760]
  • test our approach on the problem of using metalearning to predict when to prune decision...
  • PreFail

  • Referenced in 1 article [sw38952]
  • diverse failures that are likely to occur. Testing software against multiple failures poses the problem ... write a wide range of policies to prune down the large space of multiple failures ... pruning policies that we can write for them, and evaluate the speed-ups in testing...
  • siEDM

  • Referenced in 3 articles [sw28064]
  • bounds for the exact EDM. siEDM efficiently prunes the space for searching query strings ... same guarantee as ESP. We experimentally tested the ability of siEDM to index and search...
  • PICKY

  • Referenced in 4 articles [sw35293]
  • decomposition (SVD)-based peak picking and peak pruning and refinement. PICKY is developed ... study of the proposed method. PICKY is tested on 32 real 2D and 3D spectra...
  • Shatter

  • Referenced in 6 articles [sw21225]
  • savings they yield due to search space pruning. In this paper we present several ... advantage of the sparsity of permutations. We test these improvements against earlier constructions and show...
  • solverALL

  • Referenced in 2 articles [sw33799]
  • develop several effective data reduction and pruning rules, resulting in a competitive solver, clearly outperforming ... most instances of an established biological test data...
  • ODEA

  • Referenced in 3 articles [sw07671]
  • functional ingredients: branching strategies, structural pruning, upper and lower cost bounds. This includes two novel ... representative testbed and perform extensive testing of our algorithms throughout all development stages. We conclude...
  • CNPGSDP

  • Referenced in 2 articles [sw02563]
  • Broadcast Simulated Unicast (BSU) and Candidate Node Pruning (CNP). In BSU, several unicast request packets ... candidate nodes. Mathematical analysis and simulation tests both show that CNPGSDP is a very effective...
  • GeSOp

  • Referenced in 1 article [sw36888]
  • method is able to perform a considerably prune of the irrelevant relationships comprising the input ... subnetwork. The performance of our method was tested by means of two experiments on gene...
  • rocTree

  • Referenced in 2 articles [sw40356]
  • dependent covariates. Motivated by ideas of randomized tests, generalized time-dependent ROC curves were used ... survival trees and to guide splitting and pruning. A detailed description of the implemented methods...
  • PMC

  • Referenced in 1 article [sw21471]
  • fast for large sparse graphs. Algorithms tested on networks of 1.8 billion edges ... graph representation periodically as vertices are pruned or searched, thus lowering memory-requirements for massive...
  • meta-CART

  • Referenced in 1 article [sw27451]
  • interactions, and then subgroup meta-analysis to test the significance of moderator effects. The previous ... tree to avoid dichotomization. In addition, new pruning rules are proposed. The performance...
  • QSYM

  • Referenced in 1 article [sw39689]
  • performance optimizations, e.g., optimistically solving constraints and pruning uninteresting basic blocks. Our evaluation shows that ... OpenJPEG, which have already been intensively tested by the state-of-the-art fuzzers...
  • HMOFA

  • Referenced in 0 articles [sw26342]
  • evolutionary process. Finally, the archive pruning strategy based on three-point shortest path is used ... hypervolume based on seventeen benchmark multi-objective test instances, and the experimental results show that...