Results 11 to 20 of about 753,553 (169)

Network flows for functions [PDF]

open access: yes2011 IEEE International Symposium on Information Theory Proceedings, 2011
16 pages, 4 ...
Virag Shah   +2 more
openaire   +2 more sources

A Reservoir Operation Policy Using Inter-Basin Water Transfer for Maximizing Hydroelectric Benefits in Brazil

open access: yesEnergies, 2020
The Hydrothermal Coordination problem consists of determining an operation policy for hydroelectric and thermoelectric plants within a given planning horizon.
Anderson Passos de Aragão   +2 more
doaj   +1 more source

Constrained flows in networks [PDF]

open access: yesTheoretical Computer Science
The support of a flow $x$ in a network is the subdigraph induced by the arcs $uv$ for which $x(uv)>0$. We discuss a number of results on flows in networks where we put certain restrictions on structure of the support of the flow. Many of these problems are NP-hard because they generalize linkage problems for digraphs.
Bang-Jensen, Jørgen   +2 more
openaire   +5 more sources

Visual Localizer: Outdoor Localization Based on ConvNet Descriptor and Global Optimization for Visually Impaired Pedestrians

open access: yesSensors, 2018
Localization systems play an important role in assisted navigation. Precise localization renders visually impaired people aware of ambient environments and prevents them from coming across potential hazards. The majority of visual localization algorithms,
Shufei Lin   +3 more
doaj   +1 more source

Flow Increment through Network Expansion

open access: yesMathematics, 2021
The network expansion problem is a very important practical optimization problem when there is a need to increment the flow through an existing network of transportation, electricity, water, gas, etc.
Adrian Marius Deaconu, Luciana Majercsik
doaj   +1 more source

Nonabelian flows in networks

open access: yesJournal of Graph Theory, 2023
AbstractIn this work we consider a generalization of graph flows. A graph flow is, in its simplest formulation, a labelling of the directed edges with real numbers subject to various constraints. A common constraint is conservation in a vertex, meaning that the sum of the labels on the incoming edges of this vertex equals the sum of those on the ...
openaire   +4 more sources

A Real-Time Network Traffic Classifier for Online Applications Using Machine Learning

open access: yesAlgorithms, 2021
The increasing ubiquity of network traffic and the new online applications’ deployment has increased traffic analysis complexity. Traditionally, network administrators rely on recognizing well-known static ports for classifying the traffic flowing their ...
Ahmed Abdelmoamen Ahmed, Gbenga Agunsoye
doaj   +1 more source

A Theorem on Flows in Networks [PDF]

open access: yesPacific Journal of Mathematics, 1957
The theorem to be proved in this note is a generalization of a well-known combinatorial theorem of P. Hall, [4].
openaire   +3 more sources

Towards Distributed Lexicographically Fair Resource Allocation with an Indivisible Constraint

open access: yesMathematics, 2022
In the cloud computing and big data era, data analysis jobs are usually executed over geo-distributed data centers to make use of data locality. When there are not enough resources to fully meet the demands of all the jobs, allocating resources fairly ...
Chuanyou Li   +3 more
doaj   +1 more source

Asymmetric flow networks [PDF]

open access: yesEuropean Journal of Operational Research, 2014
This research is supported by the Spanish Ministerio de Economía y Competitividad under projects ECO2009-11213 and ECO2009-07939, co-funded by the ERDF. Both authors also bene t from the Basque Government s funding to Grupos Consolidados GIC07/146-IT-377-07 and GIC07/22-IT-223 ...
Norma Olaizola, Federico Valenciano
openaire   +4 more sources

Home - About - Disclaimer - Privacy