Results 71 to 80 of about 279,848 (302)
Downlink Traffic Scheduling with Contact Durations Awareness for Vehicular Infrastructures
International Journal of Distributed Sensor Networks, 2014 The vehicular infrastructures or roadside units (RSUs) in vehicular delay tolerant networks (VDTNs) can be used as the gateways of the distributed sensor networks.
Zhongjiang Yan, Bo Li
doaj +1 more source
, 2007 Motivated by various applications to computer vision, we consider an integer convex optimization problem which is the dual of the convex cost network flow problem.
Kolmogorov, V., Shioura, A.
core
Karl Popper and the Mechanisms of Hydrogen Embrittlement
Advanced Engineering Materials, EarlyView.Representation of the beginning of loss of ductility rather than embrittlement. Small concentrations of hydrogen in a diffusible form within iron are well‐established to harm the mechanical integrity of steels. There are theories that attempt to explain the pernicious role of hydrogen.
H. K. D. H. Bhadeshia
wiley +1 more source
The Maximum Flow and Minimum Cost–Maximum Flow Problems: Computing and Applications
Asian Journal of Probability and Statistics, 2020 The maximum flow and minimum cost-maximum flow problems are both concerned with determining flows through a network between a source and a destination. Both these problems can be formulated as linear programming problems. When given information about a network (network flow diagram, capacities, costs), computing enables one to arrive at a solution to ...
openaire +2 more sources
Generalization of a theorem on the parametric maximum flow problem
Discrete Applied Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
T. Arai, S. Ueno, Y. Kajitani
openaire +1 more source
On the Bicriterion Maximum Flow Network Interdiction Problem
CoRR, 2020 This article focuses on a biobjective extension of the maximum flow network interdiction problem, where each arc in the network is associated with two capacity values. Two maximum flows from a source to a sink are to be computed independently of each other with respect to the first and second capacity function, respectively, while an interdictor aims ...
Luca E. Schäfer +3 more
openaire +2 more sources
Maximum bipartite matching problem via maximum flow in flow networks
, 2014 Ovaj rad bavi se problemom pronalaska maksimalnog sparivanja bipartitnog grafa pomoću maksimalnog toka. U radu je dan opći prikaz bitnijih definicija vezanih uz grafove te mreže toka kao i način prikazivanja grafova na računalima.
Spajić, Zvonimir
core
Fostering Innovation: Streamlining Magnetocaloric Materials Research by Digitalization
Advanced Engineering Materials, EarlyView.Magnetocaloric cooling (MCE) is an environmentally friendly refrigeration method with great potential. Optimizing MCE materials involves the preparation and screening of large quantities of samples, which in turn generates a large amount of data. A digitalization approach is presented that uses ontologies, knowledge graphs, and digital workflows to ...
Simon Bekemeier +17 more
wiley +1 more source
, 2023 Dijkstra algoritam i Bellman-Ford algoritam su algoritmi koji se koriste za pronalaženje najkraćeg puta u težinskom grafu. Dijkstra algoritam djeluje na pozitivnim težinama bridova i koristi se za pronalaženje najkraćeg puta od jednog početnog vrha do ...
Piplica, Jelena
core +2 more sources
Reverse maximum flow problem under the weighted Chebyshev distance
, 2018 Given a network G(V, A, u) with two specific nodes, a source node s and a sink node t, the reverse maximum flow problem is to increase the capacity of some arcs (i, j) as little as possible under bound constraints on the modifications so that the maximum
Javad Tayyebi +2 more
core +1 more source