Zobrazeno 1 - 10
of 269
pro vyhledávání: '"Birkhoff's representation theorem"'
Autor:
Chunlai Zhou
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 26:1968-1974
The Dempster-Shafer theory of belief functions is an important approach to deal with uncertainty in AI. In the theory, belief functions are defined on Boolean algebras of events. In many applications of belief functions in real world problems, howeve
Recently [Mai and Vazirani, 2018] identified and initiated work on a new problem, namely understanding structural relationships between the lattices of solutions of two "nearby" instances of stable matching. They also gave an application of their wor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::717f9172fedb183414e47a59ff094f1a
Autor:
Yuri Faenza, Xuan Zhang
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030738785
IPCO
IPCO
Birkhoff’s representation theorem [11] defines a bijection between elements of a distributive lattice \(\mathcal{L}\) and the family of upper sets of an associated poset \(\mathcal{B}\). When elements of \(\mathcal{L}\) are the stable matchings in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc67b1dac03e3c43c58081b639c6c06c
https://doi.org/10.1007/978-3-030-73879-2_7
https://doi.org/10.1007/978-3-030-73879-2_7
Publikováno v:
Discrete Optimization. 44:100631
We propose a new combinatorial optimization problem that we call the submodular reassignment problem. We are given k submodular functions over the same ground set, and we want to find a set that minimizes the sum of the distances to the sets of minim
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Logic Journal of the IGPL. 28:1021-1059
Multialgebras (or hyperalgebras or non-deterministic algebras) have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for deali
Publikováno v:
SIAM Journal on Applied Dynamical Systems, 17(2), 1617-1649. Society of Industrial and Applied Mathematics
Kasti, D, Van der vorst, R C A M & Kalies, W D 2018, ' An algorithmic approach to lattices and order in dynamics ', SIAM Journal on Applied Dynamical Systems, vol. 17, no. 2, pp. 1617-1649 . https://doi.org/10.1137/17M1139606
Kasti, D, Van der vorst, R C A M & Kalies, W D 2018, ' An algorithmic approach to lattices and order in dynamics ', SIAM Journal on Applied Dynamical Systems, vol. 17, no. 2, pp. 1617-1649 . https://doi.org/10.1137/17M1139606
Recurrent versus gradient-like behavior in global dynamics can be characterized via a surjective lattice homomorphism between certain bounded, distributive lattices, that is, between attracting blocks (or neighborhoods) and attractors. Using this cha
Publikováno v:
LINEAR ALGEBRA AND ITS APPLICATIONS
It was shown recently that Birkhoff's theorem for doubly stochastic matrices can be extended to unitary matrices with equal line sums whenever the dimension of the matrices is prime. We prove a generalization of the Birkhoff theorem for unitary matri
Autor:
Abdelaziz Amroune, Ali Oumhani
Publikováno v:
Journal of Intelligent & Fuzzy Systems. 32:35-42
Autor:
Marcin Łazarz, Krzysztof Siemieńczuk
Publikováno v:
Studia Logica. 105:471-478
In the paper we introduce two conditions (D) and (\(\hbox {D}^*\)) which are strengthenings of Birkhoff’s conditions. We prove that an upper continuous and strongly atomic lattice is distributive if and only if it satisfies (D) and (\(\hbox {D}^*\)