Sentence examples for computing extension from inspiring English sources

Our distributed computing extension makes it possible to use the same high-level model for specifying algorithms, while the algorithm can be carried out in a distributed computing environment, with limited overhead for communication between the compute nodes.

This means that computing extensions and answering queries about coherence, set-membership and set-entailment are reducible to propositional satisfiability.

We present an approach for computing extensions of velocities or other fields in level set methods by solving a biharmonic equation.

We first present the evolution of vehicle communication architectures from the conventional VANET framework to vehicular cloud computing extensions along with related security mechanisms.

By their nature, dialogue games are typically dedicated to a specific reasoning problem, but sometimes they can also be used to actually compute extensions.

This establishes for the first time a strong connection between computing abductive explanations and computing extensions in default logic.

No explicit properties of the interface, such as its location or the velocity on the interface, are required in computing the extension.

The relative ease of computing default extensions has made it one of the more popular systems.

Given that we are only interested in the acceptance of a certain argument, we might directly try to produce a witness (or counter-example) for this argument instead of computing all extensions.

In the reduction-based approach the distinction between computing all extensions and performing specific reasoning tasks is often delegated to the reasoner of the target formalism and thus can be neglected.

Mechanics for frictional bridging and nonlinear fiber-creep equations are used to compute crack extension dynamically.