Results 51 to 60 of about 86,434 (167)
A graph based architectural (Re)configuration language [PDF]
For several different reasons, such as changes in the business or technological environment, the configuration of a system may need to evolve during execution. Support for such evolution can be conceived in terms of a language for specifying the dynamic reconfiguration of systems.
Wermelinger, Michel +2 more
openaire +1 more source
Intelligent prediction method of network performance based on graph neural network
There are some problems in the traditional network performance prediction technology, such as incomplete network state acquisition and poor accuracy of network performance evaluation.Combined with the characteristics of graph neural network learning and ...
Yijiang LI +5 more
doaj +2 more sources
Adaptive Exponential Synchronization of Coupled Complex Networks on General Graphs
We investigate the synchronization in complex dynamical networks, where the coupling configuration corresponds to a weighted graph. An adaptive synchronization method on general coupling configuration graphs is given.
Song Liu +3 more
doaj +1 more source
Irreducible \((v_{3})\) configurations and graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
This paper investigates the application of graph theory and variants of greedy graph coloring algorithms for the optimization of distributed peer-to-peer networks, with a special focus on private blockchain networks.
Miljenko Švarcmajer +3 more
doaj +1 more source
On topological aspects of degree based entropy for two carbon nanosheets
The entropy-based procedures from the configuration of chemical graphs and multifaceted networks, several graph properties have been utilized. For computing, the organizational evidence of organic graphs and multifaceted networks, the graph entropies ...
Manzoor Shazia +3 more
doaj +1 more source
Graph-based system configuration
We present an optimization problem that arises in the context of system-design and the refinement of high-level specifications. We present a graph-based formalization of the problem, thus defining a new optimization problem, which we call MINIMUM CONFIGURATION. We prove MINIMUM CONFIGURATION to be NP-hard and also hard to approximate, i.e. not to be in
openaire +3 more sources
(2E,4E)-1-(2-Hydroxyphenyl)-5-phenylpenta-2,4-dien-1-one
In the structure of the title chalcone, C17H14O2, derived from cinnamaldehyde, the olefine group has a trans configuration. The molecular conformation is stabilized by an intramolecular O—H...O hydrogen-bond interaction with graph-set motif S(6)
W. A. Silva, C. C. Gatto, G. R. Oliveira
doaj +1 more source
Self-Dual Configurations and Their Levi Graphs [PDF]
Introduction. By a configuration we shall mean a set of points and straight lines (or planes) between which certain well-determined incidences exist. These configurations are not necessarily regular, that is, we shall not suppose every line (plane) to be incident with the same number of configuration points, and dually, different points of the ...
openaire +1 more source
Forbidden configurations in intersection graphs of r-graphs
AbstractAn r-graph or r-uniform hypergraph is a finite family of subsets of a set X in which each subset has cardinality r. The intersection graph of an r-graph H is the graph whose nodes are the sets of H with two nodes adjacent whenever the corresponding sets have a nonempty intersection.
openaire +2 more sources

