Results 141 to 150 of about 432,855 (169)
Some of the next articles are maybe not open access.
Mind, 1994
Let L be the language of first order arithmetic; and let N be the set of sentences of L true in the standard interpretation. It is well-known that N has many (in fact, absolutely infinitely many) models other than the standard interpretation. All of these models extend the standard interpretation in a certain sense, and have an interesting common ...
openaire +3 more sources
Let L be the language of first order arithmetic; and let N be the set of sentences of L true in the standard interpretation. It is well-known that N has many (in fact, absolutely infinitely many) models other than the standard interpretation. All of these models extend the standard interpretation in a certain sense, and have an interesting common ...
openaire +3 more sources
ACM Inroads, 2013
The most common measure for an algorithm's efficiency is its running time, described as a function of the input length. Traditionally, however, several inconsistencies have found their way even to the analysis of the most classical algorithms. In some cases these are 'slight' inconsistencies, in the sense that their effect may change the result by a ...
openaire +1 more source
The most common measure for an algorithm's efficiency is its running time, described as a function of the input length. Traditionally, however, several inconsistencies have found their way even to the analysis of the most classical algorithms. In some cases these are 'slight' inconsistencies, in the sense that their effect may change the result by a ...
openaire +1 more source
2004
Partial Consistency is a preeminent property for improving the solving process of a constraint satisfaction problem. This property is depicted by the omnipresence of several levels of consistency among which circuit consistency. Two non-equivalent definitions have been proposed for this level.
Abdellah Idrissi, Ahlem Ben Hassine
openaire +1 more source
Partial Consistency is a preeminent property for improving the solving process of a constraint satisfaction problem. This property is depicted by the omnipresence of several levels of consistency among which circuit consistency. Two non-equivalent definitions have been proposed for this level.
Abdellah Idrissi, Ahlem Ben Hassine
openaire +1 more source
1985
Many recent discussions of universality tests, particularly those in English, are concerned either with what everybody wants done or with what somebody (usually the agent: sometimes an anonymous moral spectator) wants done either by or to everybody. This is true of the universality tests proposed in Singer’s Generalization Argument, in Hare’s Universal
openaire +1 more source
Many recent discussions of universality tests, particularly those in English, are concerned either with what everybody wants done or with what somebody (usually the agent: sometimes an anonymous moral spectator) wants done either by or to everybody. This is true of the universality tests proposed in Singer’s Generalization Argument, in Hare’s Universal
openaire +1 more source
Consistency issues in the best worst method: Measurements and thresholds
Omega, 2020Fuqi Liang +2 more
exaly
Consistency in Non-Transactional Distributed Storage Systems
ACM Computing Surveys, 2017Marko Vukolić
exaly