Results 121 to 130 of about 4,626,092 (310)
Minimum cost arborescences [PDF]
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the well ...
Dutta, Bhaskar, Mishra, Debasis
core
dynoGP: Deep Gaussian Processes for Dynamic System Identification
This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli +3 more
wiley +1 more source
The P-Value for Cost Sharing in Minimum Cost Spanning Tree Situations [PDF]
The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to solve the cost sharing problem in minimum cost spanning tree (mcst) situations.The P-value is related to the Kruskal algorithm for finding an mcst.Moreover, the
Moretti, S. +3 more
core
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
Transboundary pollution creates a governance problem in which the region controlling emissions does not fully bear the resulting environmental damage, while the affected region suffers pollution exposure without direct control over source-side decisions.
Yuhang Gu, Xuchen Luo
doaj +1 more source
A unified research data management framework for heterogeneous materials data is presented. The system integrates multimodal datasets using ontologies and knowledge graphs, enabling interoperability and FAIR (findable, accessible, interoperable, reusable) data principles. By linking data across scales and workflows, it supports reproducible, Artifitial
Doaa Mohamed +6 more
wiley +1 more source
A Vertex Oriented Approach to Minimum Cost Spanning Tree Problems [PDF]
In this paper we consider spanning tree problems, where n players want to be connected to a source as cheap as possible. We introduce and analyze (n!) vertex oriented construct and charge procedures for such spanning tree situations leading in n steps to
Tijs, S.H., Ciftci, B.B.
core
Minimum Cost Arborescences [PDF]
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the well ...
Dutta, Bhaskar, Mishra, Debasis
core +2 more sources
Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows
A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba +5 more
wiley +1 more source
Auditing Cost Overrun Claims [PDF]
We consider a cost-reimbursement or a cost-sharing procurement contract between the administration and a firm. The firm privately learns the true cost overrun once the project has started and it can manipulate this information.
David Pérez-Castrillo +1 more
core

