Results 71 to 80 of about 2,664,283 (267)
On the probabilistic min spanning tree Problem [PDF]
, 2010 International audienceWe study a probabilistic optimization model for min spanning tree, where any vertex v i of the input-graph G(V, E) has some presence probability p i in the final instance G′ ⊂ G that will effectively be optimized.
Paschos, V.T. +10 more
core +1 more source
, 2017 A Smarandache k-orientation of G for an integer k ≥ 0 is such an orientation on G with exactly k oriented cycles.
Rodolfo Conde, Criel Merino
openaire +2 more sources
Advanced Science, EarlyView.This study investigates how the internal structure of fiber‐reinforced ceramic composites affects their resistance to damage. By combining 3D X‐ray imaging with acoustic emission monitoring during mechanical testing, it reveals how silicon distribution influences crack formation.
Yang Chen +7 more
wiley +1 more source
The tree width of auxiliary storage [PDF]
, 2011 We propose a generalization of results on the decidability of emptiness for several restricted classes of sequential and distributed automata with auxiliary storage (stacks, queues) that have recently been proved.
Parlato, Gennaro +3 more
core +1 more source
ML Workflows for Screening Degradation‐Relevant Properties of Forever Chemicals
Advanced Science, EarlyView.The environmental persistence of per‐ and polyfluoroalkyl substances (PFAS) necessitates efficient remediation strategies. This study presents physics‐informed machine learning workflows that accurately predict critical degradation properties, including bond dissociation energies and polarizability.
Pranoy Ray +3 more
wiley +1 more source
Hierarchical models for service-oriented systems [PDF]
, 2011 We present our approach to the denotation and representation of hierarchical graphs: a suitable algebra of hierarchical graphs and two domains of interpretations.
Gadducci, Fabio +11 more
core +1 more source
L(2, 1)-Labelings of Some Families of Oriented Planar Graphs
Discussiones Mathematicae Graph Theory, 2014 In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Sen Sagnik
doaj +1 more source
Sustainable Materials Design With Multi‐Modal Artificial Intelligence
Advanced Science, EarlyView.Critical mineral scarcity, high embodied carbon, and persistent pollution from materials processing intensify the need for sustainable materials design. This review frames the problem as multi‐objective optimization under heterogeneous, high‐dimensional evidence and highlights multi‐modal AI as an enabling pathway.
Tianyi Xu +8 more
wiley +1 more source
Average tree solutions for graph games [PDF]
In this paper we consider cooperative graph games being TU-games in which players cooperate if they are connected in the communication graph. We focus our attention to the average tree solutions introduced by Herings, van der Laan and Talman [6] and ...
Remila, Eric +3 more
core
Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem [PDF]
, 2009 This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible.
Darby-Dowman, K +3 more
core +1 more source