Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
Myra B. Cohen, Charles J. Colbourn, Alan C. H. Lin...
This article presents a new evolutionary algorithm (EA) for induction of mixed decision trees. In nonterminal nodes of a mixed tree, different types of tests can be placed, rangin...
In this paper, we contribute a new paradigm of combining string recognizers and propose generic frameworks for hierarchical and parallel combination of multiple string recognizers...
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...