Results 21 to 30 of about 15,736 (246)
Small models of convex fragments of definable subsets
Қарағанды университетінің хабаршысы. Математика сериясы, 2020 This article discusses the problems of that part of Model Theory that studies the properties of countable models of inductive theories with additional properties, or, in other words, Jonsson theories.
A.R. Yeshkeyev, N.V. Popova
doaj +1 more source
Another bijection between $2$-triangulations and pairs of non-crossing Dyck paths [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 A $k$-triangulation of the $n$-gon is a maximal set of diagonals of the $n$-gon containing no subset of $k+1$ mutually crossing diagonals. The number of $k$-triangulations of the $n$-gon, determined by Jakob Jonsson, is equal to a $k \times k$ Hankel ...
Carlos M. Nicolás
doaj +1 more source
Why are CSPs Based on Partition Schemes Computationally Hard? [PDF]
, 2018 Many computational problems arising in, for instance, artificial intelligence can be realized as infinite-domain constraint satisfaction problems (CSPs) based on partition schemes: a set of pairwise disjoint binary relations (containing the equality ...
Lagerkvist, Victor, +3 more
core +1 more source
Hom complexes of set systems [PDF]
, 2013 A set system is a pair S = (V (S), Delta(S)), where Delta(S) is a family of subsets of the set V(S). We refer to the members of Delta(S) as the stable sets of S.
Jonsson, Jakob,
core +1 more source
A fragment of a theoretical set and its strongly minimal central type [PDF]
, 2023 The paper defines a new class of algebras, the theory of which is a special case of Jonsson theories. This class applies to both varieties and Jonsson theories. The main results of this article are the following two results. In this article, an answer is
N.V. Popova, N.V. Popova, O.I. Ulbrikht
core +1 more source
Set Function Optimization [PDF]
, 2018 This article is an introduction to recent development of optimization theory on set functions, the nonsubmodular optimization, which contains two interesting results, DS (difference of submodular) functions decomposition and sandwich theorem, together ...
Wu, Weili, Du, Dingzhu, Zhang, Z.
core +1 more source
Companions of the fragments in the Jonsson enrichment
Қарағанды университетінің хабаршысы. Математика сериясы, 2017 In this article we consider the properties of central types for the existentially prime strongly convex Jonsson theories in some extension. This class of theories is a subclass of a broad class of Jonsson theories.
A.R. Yeshkeyev
doaj +1 more source
Double factorization of the Jonsson spectrum
Қарағанды университетінің хабаршысы. Математика сериясыFirst of all, we have to note that in this article, we introduced the new concepts of relations between Jonsson theories in the class of cosemanticness for some considered Jonsson spectrum.
A.R. Yeshkeyev +2 more
doaj +1 more source
Computing the minimum EDF feasible deadline in periodic systems [PDF]
, 2006 In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requirements can be met by assigning suitable relative deadlines and guaranteeing the ...
Hoang, Hoai +14 more
core +1 more source
Generalized planning as heuristic search [PDF]
, 2021 Comunicació presentada a ICAPS2021, celebrat del 2 a 13 d'agost de 2021 de manera virtual.Although heuristic search is one of the most successful approaches to classical planning, this planning paradigm does not apply straightforwardly to ...
Jiménez, Sergio +3 more
core +1 more source