Results 81 to 90 of about 383,776 (277)

Shortest Path Network Interdiction With Goal Threshold

open access: yesIEEE Access, 2018
Network defense and attack problems can be modeled as network interdictions. In this paper, we consider a new version of the network interdiction problem that optimizes the interdictor's resource consumption while limiting network capacities (e.g., the ...
Xiangyu Wei   +4 more
doaj   +1 more source

Additive Gaussian Process Regression for Predictive Design of High‐Performance, Printable Silicones

open access: yesAdvanced Engineering Materials, EarlyView.
A chemistry‐aware design framework for tuning printable polydimethylsiloxane (PDMS) for vat photopolymerization (VPP) is developed using additive Gaussian process (GP) modeling. Polymer network mechanics informs variable groupings, feasible formulation constraints, and interaction variables.
Roxana Carbonell   +3 more
wiley   +1 more source

SHORTEST PATH ALGORITHMS FOR PETRI NETS

open access: yesElectrica, 2016
Petri net is a mathematical and graphical tool for modeling and analysing discrete event systems. This paper focuses on a driving Petri net system from a given initial state to a desired state via minimum number of operations, that is, through the ...
Hanife APAYDIN ÖZKAN
doaj   +2 more sources

Distributional Properties of Stochastic Shortest Paths for Smuggled Nuclear Material [PDF]

open access: yesJournal of Systemics, Cybernetics and Informatics, 2012
The shortest path problem on a network with fixed weights is a well studied problem with applications to many diverse areas such as transportation and telecommunications.
Leticia Cuellar   +3 more
doaj  

The Capacity Expansion Path Problem in Networks

open access: yesJournal of Applied Mathematics, 2013
This paper considers the general capacity expansion path problem (GCEP) for the telecommunication operators. We investigate the polynomial equivalence between the GCEP problem and the constrained shortest path problem (CSP) and present a pseudopolynomial
Jianping Li, Juanping Zhu
doaj   +1 more source

On the Influence of Antioxidants and Recycled MgO–C Source Material on the Mechanical Properties of Carbon‐Bonded Magnesia Refractories

open access: yesAdvanced Engineering Materials, EarlyView.
The presented study focuses on the fracture behaviour of carbon‐bonded magnesia MgO–C refractories, where environmentally friendly fructose, collagen and lignin serve as temporary binding agents. The partial substitution of the source material with recycled MgO–C reduces the fracture resistance, which can be counteracted by the additional introduction ...
Marc Neumann   +6 more
wiley   +1 more source

Fuzzy Shortest Path Problem Based on Level 𝜆-Triangular LR Fuzzy Numbers

open access: yesAdvances in Fuzzy Systems, 2012
In problems of graphs involving uncertainties, the fuzzy shortest path problem is one of the most studied topics, since it has a wide range of applications in different areas and therefore deserves special attention.
S. Elizabeth, L. Sujatha
doaj   +1 more source

Influence of an Oxygen‐Free Atmosphere on Diamond‐Single‐Grain Scratching of Ti–6Al–4V

open access: yesAdvanced Engineering Materials, EarlyView.
Single‐grain scratching of Ti–6Al–4V is investigated under controlled, oxygen‐free, and ambient atmospheres using a novel experimental setup with in situ high‐speed imaging. The approach enables direct observation of chip formation and adhesion under suppressed oxidation.
Berend Denkena   +2 more
wiley   +1 more source

Al–Cu Composite Casting of Laser‐Deoxidized Copper: Bonding, Interfacial Chemistry, and Thermal Conductivity

open access: yesAdvanced Engineering Materials, EarlyView.
This study investigates laser‐based oxide removal of Cu inserts in oxygen‐free conditions and examines long‐term oxidation kinetics and surface chemistry under different atmospheres via X‐ray photoelectron spectroscopy. Al–Cu compound casting with differently oxidized surfaces is performed, and intermetallic phase formation, morphology, and thermal ...
Timon Steinhoff   +9 more
wiley   +1 more source

Computing shortest paths in 2D and 3D memristive networks

open access: yes, 2013
Global optimisation problems in networks often require shortest path length computations to determine the most efficient route. The simplest and most common problem with a shortest path solution is perhaps that of a traditional labyrinth or maze with a ...
Prodromakis, Themistoklis   +2 more
core  

Home - About - Disclaimer - Privacy