Journal of the Association for Computing Machinery

@article{1961JournalOT,
title={Journal of the Association for Computing Machinery},
author={},
journal={Nature},
year={1961},
volume={190},
pages={864}
}

Using linear algebra and a branching analog of the classic Euler theorem, it is shown that, under an assumption that the terminal alphabet is fixed, the membership problem for regular grammars is P, and that the equivalence problem for context free grammARS is in $\mathrm{\Pi_2^P}$.Expand

We consider the problem of scheduling n independent jobs on m unrelated parallel machines where each job has to be processed by exactly one machine, processing job j on machine i requires pij time… Expand

In many biological fields (e.g. horticulture, forestry, botany), a need exists to quantify different types of variability within a set of plants. In this paper, we propose a method to compare plant… Expand

The goal is to find a denominator bound (also known as universal denominator) for the solutions of linear systems of recurrence equations whose coefficients are given in terms of indefinite nested sums and products covering, e.g., the harmonic numbers, hypergeometric products, q-hypergeometry products or their mixed versions.Expand

2016 IEEE 14th International Conference on Software Engineering Research, Management and Applications (SERA)

2016

TLDR

By defining port operations, the representation of an architecture with the proposed formulism is simpler comparing with those by other ADLs, and an architecture is a semigroup to the component operations: composing and nesting.Expand

The presented method parses the set of training data, consisting of normal and anomaly data, and separates the data into two clusters, each cluster represented by its centroid - one of the normal observations, and the other - for the anomalies.Expand