Results 11 to 20 of about 3,487,614 (309)
Completability vs (In)completeness [PDF]
In everyday conversation, no notion of “complete sentence” is required for syntactic licensing. However, so-called “fragmentary”, “incomplete”, and abandoned utterances are problematic for standard formalisms. When contextualised, such data show that (a) non-sentential utterances are adequate to underpin agent coordination, while (b) all linguistic ...
Gregoromichelaki, Eleni +8 more
openaire +3 more sources
On the completeness of complete markets [PDF]
We reconsider the allocational invariance of equilibria to different formulations of market completeness. We identify the so-far neglected assumption of sophisticated behavior as being crucial. First, the arrow–debreu setting is considered, where markets do not reopen in the future. Second, sequentially complete markets are analyzed, where goods on the
Herings P. Jean-Jacques +1 more
openaire +6 more sources
.
Burazeri, Genc +3 more
openaire +2 more sources
Poisson Matrix Completion [PDF]
We extend the theory of matrix completion to the case where we make Poisson observations for a subset of entries of a low-rank matrix. We consider the (now) usual matrix recovery formulation through maximum likelihood with proper constraints on the ...
Cao, Yang, Xie, Yao
core +1 more source
In this paper we develop a theory of matrix completion for the extreme case of noisy 1-bit observations. Instead of observing a subset of the real-valued entries of a matrix M, we obtain a small number of binary (1-bit) measurements generated according ...
Berg, Ewout van den +3 more
core +1 more source
MacNeille completion and profinite completion can coincide on finitely generated modal algebras [PDF]
Following Bezhanishvili & Vosmaer, we confirm a conjecture of Yde Venema by piecing together results from various authors. Specifically, we show that if $\mathbb{A}$ is a residually finite, finitely generated modal algebra such that $\operatorname{HSP ...
Vosmaer, Jacob
core +5 more sources
Optimization in task--completion networks [PDF]
We discuss the collective behavior of a network of individuals that receive, process and forward to each other tasks. Given costs they store those tasks in buffers, choosing optimally the frequency at which to check and process the buffer. The individual
Cobham A +9 more
core +1 more source
Completion of an Experiment [PDF]
At the beginning of 2017, mSphere initiated an experiment in peer review called mSphereDirect ([1][1]). At that time, we sensed the desire among authors to have more control over the peer review process, which had become slow and rigid, with some even arguing that peer review is “broken.”
Imperiale, Michael J +10 more
openaire +8 more sources
Theory completion using inverse entailment [PDF]
The main real-world applications of Inductive Logic Programming (ILP) to date involve the "Observation Predicate Learning" (OPL) assumption, in which both the examples and hypotheses define the same predicate.
Bryant, CH, Muggleton, SH
core +2 more sources

