Results 11 to 20 of about 1,512,917 (302)

Completion of choice [PDF]

open access: yesAnnals of Pure and Applied Logic, 2021
We systematically study the completion of choice problems in the Weihrauch lattice. Choice problems play a pivotal role in Weihrauch complexity. For one, they can be used as landmarks that characterize important equivalences classes in the Weihrauch lattice.
Vasco Brattka, Guido Gherardi
openaire   +4 more sources

On the completeness of complete markets [PDF]

open access: yesEconomic Theory, 2007
We reconsider the allocational invariance of equilibria to different formulations of market completeness. We identify the so-far neglected assumption of sophisticated behavior as crucial to this result. The paper studies three market structures. First, the Arrow-Debreu setting is considered.
P. Jean-Jacques Herings, Kirsten Rohde
openaire   +4 more sources

Completion-time-driven scheduling for uplink NOMA-enabled wireless networks

open access: yes, 2020
Efficient scheduling policy is crucial in wireless networks due to delay-sensitivity of many emerging applications. In this work, we consider a joint user pairing and scheduling (UPaS) scheme for multi-carrier non-orthogonal multiple access (MC-NOMA ...
Saeedeh Parsaeefard (7207586)   +4 more
core   +6 more sources

Completion of the Causal Completability Problem [PDF]

open access: yesThe British Journal for the Philosophy of Science, 2015
We give a few results concerning the notions of causal completability and causal closedness of classical probability spaces (Hofer-Szabo, Redei & Szabo [1999], Gyenis & Redei [2004]). Answering a question from Hofer-Szabo et al. [1999], we prove that any classical probability space has a causally closed extension. We also employ the notion of causal up-
Wroński, Leszek, Marczyk, Michał
openaire   +2 more sources

A hierarchical approach to 3D non-parametric surface relief completion [PDF]

open access: yes, 2012
Typical stereo and laser scan based 3D acquisition approaches are essentially limited to 2.5D capture. The resulting 3D completion problem, to derive missing information in 2.5D scenes from limited contextual information, has received increasing ...
Fisher, Robert B.   +5 more
core   +1 more source

The President's Completion Power [PDF]

open access: yes, 2006
This Essay identifies and analyzes the President's completion power: the President's authority to prescribe incidental details needed to carry into execution a legislative scheme, even in the absence of congressional authorization to complete that scheme.
Manning, John, Goldsmith, Jack
core   +6 more sources

Separate cortical stages in amodal completion revealed by functional magnetic resonance adaptation [PDF]

open access: yes, 2007
Background: Objects in our environment are often partly occluded, yet we effortlessly perceive them as whole and complete. This phenomenon is called visual amodal completion.
Weigelt, S.   +8 more
core   +1 more source

Completability vs (In)completeness [PDF]

open access: yesActa Linguistica Hafniensia, 2020
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

Complete completion using types and weights [PDF]

open access: yesACM SIGPLAN Notices, 2013
Developing modern software typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that synthesizes and suggests valid expressions of a given type at a given program point.
Gvero, Tihomir   +3 more
openaire   +3 more sources

Minimizing the condition number of a positive definite matrix by completion [PDF]

open access: yes, 1994
Elsner L, He C, Mehrmann V. Minimizing the condition number of a positive definite matrix by completion. Numerische Mathematik. 1994;69(1):17-23.We consider the problem of minimizing the spectral condition number of a positive definite matrix by ...
Mehrmann, Volker   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy