Results 21 to 30 of about 119,472 (328)
Activity of imipenem/relebactam against KPC-producing Klebsiella pneumoniae and the possible role of Ompk36 mutation in determining resistance: an Italian retrospective analysis [PDF]
Annals of Clinical Microbiology and AntimicrobialsBackground Antimicrobial resistance in Enterobacterales represents a substantial threat in modern clinical practice and the collection of data on the efficacy of new molecules is of paramount importance.
Emanuele Palomba +12 more
doaj +2 more sources
A Distributed Algorithm for the Minimum Diameter Spanning Tree Problem
, 2004 We present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (non-negatively) real-weighted graph G=(V,E,\omega). As an intermediate step, we use a new, fast, linear-time all-pairs shortest paths distributed algorithm to find an absolute center of G.
Bui, Marc +2 more
openaire +3 more sources
Mind the
Algorithms, 2023 We present two algorithms in the quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability: one for producing an approximately optimal Steiner tree, and one for producing an exact directed minimum spanning tree, each of ...
Phillip Kerger +3 more
doaj +1 more source
Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree [PDF]
arXiv.org, 2023 We study the classic Euclidean Minimum Spanning Tree (MST) problem in the Massively Parallel Computation (MPC) model. Given a set $X \subset \mathbb{R}^d$ of $n$ points, the goal is to produce a spanning tree for $X$ with weight within a small factor of ...
Rajesh Jayaram +3 more
semanticscholar +1 more source
Data‐driven performance metrics for neural network learning
International Journal of Adaptive Control and Signal Processing, EarlyView., 2023 Summary Effectiveness of data‐driven neural learning in terms of both local mimima trapping and convergence rate is addressed. Such issues are investigated in a case study involving the training of one‐hidden‐layer feedforward neural networks with the extended Kalman filter, which reduces the search for the optimal network parameters to a state ...
Angelo Alessandri +2 more
wiley +1 more source
, 2001 International audienceThis paper develops linear time distributed algorithm, on general graphs, for the minimum spanning tree, in asynchronous communication network.
Lélia Blin, Franck Butelle
openalex +3 more sources
The Diameter of the Minimum Spanning Tree of a Complete Graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Let $X_1,\ldots,X_{n\choose 2}$ be independent identically distributed weights for the edges of $K_n$. If $X_i \neq X_j$ for$ i \neq j$, then there exists a unique minimum weight spanning tree $T$ of $K_n$ with these edge weights.
Louigi Addario-Berry +2 more
doaj +1 more source
From sequential layers to distributed processes: deriving a distributed minimum weight spanning tree algorithm [PDF]
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1992 Analysis and design of distributed algorithms and protocols are difficult issues. An important cause for those difficulties is the fact that the logical structure of the solution is often invisible in the actual implementation.
W. Janssen, J. Zwiers
semanticscholar +4 more sources
Topology Optimization of Pipe Network in a Distributed Energy System
Chemical Engineering Transactions, 2020 Under the stress of energy saving and environmental conservation, distributed energy system becomes more promising due to its high energy efficiency. Previous research on the network of distributed energy system mainly emphasize shortest pipe length, but
Wei Gao +6 more
doaj +1 more source