Results 241 to 250 of about 238,886 (292)
Some of the next articles are maybe not open access.

Related searches:

Expressive capacity of subregular expressions

RAIRO - Theoretical Informatics and Applications, 2018
Different types of subregular expressions are studied. Each type is obtained by either omitting one of the regular operations or replacing it by complementation or intersection. For uniformity and in order to allow non-trivial languages to be expressed, the set of literals is a finite set of words instead of letters.
Martin Kutrib, Matthias Wendlandt
openaire   +4 more sources

Expression Templates for Dot Product Expressions

Reliable Computing, 1999
We use expression templates to obtain an easy to use, efficient C++ component for the computation of dot product expressions. Since loop fusion is done at compile time, we only need one dotprecision variable for arbitrary dot product expressions. The algorithms can easily be adapted to exploit parallelism in a distributed environment.
Michael Lerch   +1 more
openaire   +2 more sources

EXPRESSIBLE SEMANTICS FOR EXPRESSIBLE COUNTERFACTUALS

The Review of Symbolic Logic, 2010
Lewis (1981) showed the equivalence between two dominant semantic frameworks for counterfactuals: ordering semantics, which relies on orders between possible worlds, and premise semantics, which relies on sets of propositions (so-called ordering sources).
openaire   +1 more source

Home - About - Disclaimer - Privacy