Výsledky vyhledávání - "Barbato Michele"

Report

Mathematical Programming Algorithms for Convex Hull Approximation with a Hyperplane Budget

Autor: Barbato, Michele, Ceselli, Alberto, Messana, Rosario

We consider the following problem in computational geometry: given, in the d-dimensional real space, a set of points marked as positive and a set of points marked as negative, such that the convex hull of the positive set does not intersect the negat

Externí odkaz: http://arxiv.org/abs/2407.17341

Zobrazit plný text záznamu

Akademický článek

Influence of Production Methodology on the Pozzolanic Activity of Sugarcane Bagasse Ash

Autor: Subedi Sujata, Arce Gabriel, Hassan Marwa, Kumar Nitin, Barbato Michele, Gutierrez-Wing Maria Teresa

Publikováno v: MATEC Web of Conferences, Vol 271, p 07003 (2019)

Previous studies have shown the possibility of successful implementation of Sugarcane Bagasse Ash (SCBA) as a Supplementary Cementitious Material (SCM) in concrete production. However, its use has been constrained in the construction industry due to

Externí odkaz: https://doaj.org/article/722c4344cca24a70908a8557818080a3

Zobrazit plný text záznamu

Akademický článek

Parametric Study on the Effect of Steel Confinement in Short Bridge Piers Retrofitted with Externally-Wrapped FRP

Autor: Zignago Diogo, Barbato Michele

Publikováno v: MATEC Web of Conferences, Vol 271, p 01012 (2019)

Confinement of reinforced concrete (RC) piers generally has a beneficial effect on both the compressive strength and the ductility of the confined member. Thus, externally-bonded fiber-reinforced polymer (FRP) wrapping is often used as a retrofit tec

Externí odkaz: https://doaj.org/article/0270fa2a1c8143f6b21299f087c815af

Zobrazit plný text záznamu

Report

On the Complexity of Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage

Autor: Barbato, Michele, Bianchessi, Nicola

Given an undirected graph $G$ whose edge weights change over $s$ time slots, the sub-tree scheduling for wireless sensor networks with partial coverage asks to partition the vertices of $G$ in $s$ non-empty trees such that the total weight of the tre

Externí odkaz: http://arxiv.org/abs/2301.00739

Zobrazit plný text záznamu