Results 111 to 120 of about 542,050 (166)

FRMD: fast robot motion diffusion via trajectory-level consistency distillation. [PDF]

Front Robot AI
Shi X, Hu Y, Jin J.
europepmc   +1 more source

Artificial intelligence and the future of prosthodontics: a narrative review. [PDF]

Saudi Dent J
Jayasheelan JA, Manju V, Deepthy SS, Saranya SK.   +3 more
europepmc   +1 more source

Artistic collaborative design optimization of urban public architecture based on faster region convolutional neural network and artificial intelligence. [PDF]

Sci Rep
Wang M, Zhang K.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Complete Consistency: A Testing Analogue of Estimator Consistency

Review of Economic Studies, 1986
Let \({\mathcal P}={\mathcal P}_ 0\cup {\mathcal P}_ 1\) where \({\mathcal P}_ 0\) and \({\mathcal P}_ 1\) denote null and alternative hypotheses, and let \(C_{n,\alpha}\) be the critical region of an \(\alpha\)-level test for testing \({\mathcal P}_ 0\) versus \({\mathcal P}_ 1\) when a sample of size n is used. A sequence of tests \(\{C_{n,\alpha_ n}\
Donald W K Andrews
exaly   +3 more sources

Fast complete memory consistency verification

2009 IEEE 15th International Symposium on High Performance Computer Architecture, 2009
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new natural partial order: time order. In multiprocessor systems with store atomicity, a time order restriction exists between two operations whose pending periods are disjoint: the
Haihua Shen, Yi Lv, Weiwu Hu
exaly   +2 more sources

Complete Bound Consistency for the Global Cardinality Constraint

Constraints, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katriel Irit, Irit Katriel
exaly   +3 more sources

On Consistency and Completeness of Autoepistemic Theories

Fundamenta Informaticae, 1992
In this paper we expand the results on existence and uniqueness of stable autoepistemic expansions for finite stratified autoepistemic theories to the infinite case. We also introduce a notion of the closed world completion of autoepistemic theory T, which can be viewed as an autoepistemic version of Closed World Assumption.
Michael Gelfond, Halina Przymusinska
openaire   +2 more sources