Results 21 to 30 of about 13,736,700 (344)

Global Minimality in Constrained Inverse Source Problems for Metamaterials

open access: yesAdvanced Electromagnetics
Global minimality, boundedness, and uniqueness are established for a general, physically motivated class of inverse source problems in non-homogeneous electromagnetic media with generalized constitutive parameters.
M. R. Khodja
doaj   +3 more sources

Online Minimization Knapsack Problem

open access: yesTheoretical Computer Science, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Han, Xin, Makino, Kazuhisa
openaire   +2 more sources

From Causes for Database Queries to Repairs and Model-Based Diagnosis and Back [PDF]

open access: yes, 2014
In this work we establish and investigate connections between causes for query answers in databases, database repairs wrt. denial constraints, and consistency-based diagnosis.
Bertossi, Leopoldo, Salimi, Babak
core   +3 more sources

An algorithm to solve polyhedral convex set optimization problems [PDF]

open access: yes, 2012
An algorithm which computes a solution of a set optimization problem is provided. The graph of the objective map is assumed to be given by finitely many linear inequalities.
Carola Schrage, Andreas Löhne
semanticscholar   +1 more source

The comprehension of Italian relative clauses in poor readers and in children with Specific Language Impairment

open access: yesGlossa, 2017
Children with Specific Language Impairment (SLI) and children with Developmental Dyslexia (DD) have problems comprehending relative clauses (RCs) and find object RCs more difficult than subject RCs, as do typically developing children.
Bruna Molteni   +4 more
doaj   +2 more sources

Constraint Minimizers of Inhomogeneous Mass Subcritical Minimization Problems

open access: yesMathematical Methods in the Applied Sciences, 2020
This paper considers minimizers of the following inhomogeneous L2‐subcritical energy functional under the mass constraint . Here, N ≥ 1, , M > 0 and the inhomogeneous term m(x) satisfies 0 < m(x) ≤ 1. Applying the concentration‐compactness principle, we prove that this minimization problem admits minimizers for any M ∈ (0, ∞).
Yongshuai Gao, Shuai Li
openaire   +1 more source

CONCEPTION OF THE OPTIMAL FORM OF THE LOGICAL FUNCTIONS PRESENTATION AND PROBLEMS OF ITS IMPLEMENTATION

open access: yesРадіоелектронні і комп'ютерні системи, 2018
In scientific publications and conducted studies, the possibility of representing logical functions (LF) in alternative forms of representation is demonstrated, the characteristic feature of which is a polynomial entity, which reduces to the ...
Олена Миколаївна Панаско   +1 more
doaj   +1 more source

No case for Case in locality: Case does not help interpretation when intervention blocks A-bar chains

open access: yesGlossa, 2017
We discuss a robust yet at first sight surprising fact: individuals who have problems understanding sentences with object A-bar movement cannot use overt Case marking of the object to interpret these sentences and to associate the DPs with thematic roles.
Adriana Belletti   +2 more
doaj   +2 more sources

Learning to Solve Hard Minimal Problems

open access: yesIEEE Transactions on Pattern Analysis and Machine Intelligence, 2022
24 pages total: 14 pages main paper and 10 pages ...
Petr Hruby   +3 more
openaire   +3 more sources

Variational Problems with Lipschitzian Minimizers [PDF]

open access: yesAnnales de l'Institut Henri Poincaré C, Analyse non linéaire, 1989
We review the authors’ intermediate existence theory for the basic problem in the calculus of variation [5]. Then we show that the extremal growth condition (EGC), under which [5] asserts the existence and Lipschitzian regularity of solutions to the basic problem, is actually implied by various growth conditions used to prove Lipschitzian regularity in
Clarke, F. H., Loewen, P. D.
openaire   +2 more sources

Home - About - Disclaimer - Privacy