Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Giulia Palma"'
Publikováno v:
Energies, Vol 17, Iss 5, p 1249 (2024)
Efficient management of renewable energy resources is imperative for promoting environmental sustainability and optimizing the utilization of clean energy sources. This paper presents a pioneering European-scale study on energy management within rene
Externí odkaz:
https://doaj.org/article/372a7ac73e064b1d8dfa3a499bafdc39
Publikováno v:
Mathematics, Vol 12, Iss 4, p 604 (2024)
We explore strong Nash equilibria in the max k-cut game on an undirected and unweighted graph with a set of k colors. Here, the vertices represent players, and the edges denote their relationships. Each player, v, selects a color as its strategy, and
Externí odkaz:
https://doaj.org/article/37ddb244fc3d4fc0af9b6857453fe6ed
Autor:
Megan R. Harrison, Giulia Palma, Tomás Buendia, Marta Bueno-Tarodo, Daria Quell, Fatima Hachem
Publikováno v:
Frontiers in Sustainable Food Systems, Vol 5 (2022)
Introduction: Diets are currently unsustainable in many countries as evidenced by the growing burden of malnutrition, degradation of natural resources, contributions to climate change, and unaffordability of healthy diets. Agreement on what constitut
Externí odkaz:
https://doaj.org/article/452a51ba88c44722a9e831e7653b2071
Publikováno v:
Mathematics, Vol 10, Iss 15, p 2781 (2022)
This paper provides a formal proof of the conjecture stating that optimal colorings in max k-cut games over unweighted and undirected graphs do not allow the formation of any strongly divergent coalition, i.e., a subset of nodes able to increase thei
Externí odkaz:
https://doaj.org/article/9b0c74fcd4274944852dfb3f0b63ed9a
Publikováno v:
Pure Mathematics and Applications. 30:82-89
We investigate strong Nash equilibria in the max k-cut game on an undirected and unweighted graph with a set of k colors, where vertices represent players and the edges indicate their relations. Each player v chooses one of the available colors as it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d671015f23afb1ec193e5239e0fc5a4c
https://doi.org/10.2478/puma-2022-0013
https://doi.org/10.2478/puma-2022-0013
Publikováno v:
Journal of Mathematical Imaging and Vision. 64:693-704
A nonnegative integer sequence is k-graphic if it is the degree sequence of a k-uniform simple hypergraph. The problem of deciding whether a given sequence $$\pi $$ π is 3-graphic has recently been proved to be NP-complete, after years of studies. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae345c3fdd2ccf6b7c2e3d0b33a24eea
https://doi.org/10.1007/s10851-022-01074-2
https://doi.org/10.1007/s10851-022-01074-2
Autor:
Amanda Banks, Casey E. Eaton, Meredith Bates, Lisa Matsuyama, Giulia Palma, Amy Guerin, Kristin Weger, Bryan Mesmer, Dan Friedrich
Publikováno v:
Systems Engineering.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f857586364cf12ea79b173bf66fbaa72
https://doi.org/10.1002/sys.21665
https://doi.org/10.1002/sys.21665
Publikováno v:
Theoretical Computer Science. 896:79-97
In this paper we consider doubly symmetric Dyck words, i.e. Dyck words which are fixed by two symmetry operations α and β introduced in [1] . We study combinatorial properties of doubly symmetric Dyck words, leading to the definition of two recursi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a123b9df6df4b903cb92fe994ed1655
https://doi.org/10.1016/j.tcs.2021.10.006
https://doi.org/10.1016/j.tcs.2021.10.006
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, In press, ⟨10.1016/j.dam.2020.10.020⟩
Discrete Applied Mathematics, Elsevier, In press, ⟨10.1016/j.dam.2020.10.020⟩
Given a 3-uniform hypergraph H consisting of a set V of vertices, and T ⊆ V 3 triples, a null labelling is an assignment of ± 1 to the triples such that each vertex is contained in an equal number of triples labelled + 1 and − 1 . Thus, the sign
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3eed82c2972477c41b7dbfa15623aeb2
https://doi.org/10.1016/j.dam.2020.10.020
https://doi.org/10.1016/j.dam.2020.10.020
Publikováno v:
Mathematics; Volume 10; Issue 15; Pages: 2781
This paper provides a formal proof of the conjecture stating that optimal colorings in max k-cut games over unweighted and undirected graphs do not allow the formation of any strongly divergent coalition, i.e., a subset of nodes able to increase thei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c177c4ffcdc59138dd31d34072327119