Abstract. Adaptive star grammars generalize well-known graph grammar formalisms based on hyperedge and node replacement while retaining, e.g., parseability and the commutativity an...
Software that has been well tested and analyzed may fail unpredictably when a certain combination of conditions occurs. In Bounded Exhaustive Testing (BET) all combinations are te...
R. Barzin, S. Fukushima, William E. Howden, S. Sha...
For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated ...
Arvind Gupta, Gregory Gutin, Mehdi Karimi, Eun Jun...
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
We present an algorithm which provides the one-dimensional subspace where the Bayes error is minimized for the C class problem with homoscedastic Gaussian distributions. Our main ...