Results 41 to 50 of about 5,019,245 (200)
Measuring shoot length of submerged aquatic plants using graph analysis [PDF]
, 1985 In the last decade many models for parallel computation have been proposed and many parallel algorithms have been developed. However, few of these models have been realized and most of these algorithms are supposed to run on idealized, unrealistic ...
Hovens, H.L.E., Polder, G., Zweers, A.J.
core +8 more sources
3D Cruise Trajectory Optimization Inspired by a Shortest Path Algorithm
Aerospace, 2020 Aircrafts require a large amount of fuel in order to generate enough power to perform a flight. That consumption causes the emission of polluting particles such as carbon dioxide, which is implicated in global warming.
Alejandro Murrieta-Mendoza +2 more
doaj +1 more source
BDPS: An Efficient Spark-Based Big Data Processing Scheme for Cloud Fog-IoT Orchestration
Information, 2021 The Internet of Things (IoT) has seen a surge in mobile devices with the market and technical expansion. IoT networks provide end-to-end connectivity while keeping minimal latency.
Rakib Hossen +7 more
doaj +1 more source
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
, 2007 Integer octagonal constraints (a.k.a. ``Unit Two Variables Per Inequality'' or ``UTVPI integer constraints'') constitute an interesting class of constraints for the representation and solution of integer problems in the fields of constraint programming ...
Bagnara, Roberto +2 more
core +5 more sources
Three-Layer Energy Optimization Strategy for CHP Microgrid Considering Path Loss
Zhongguo dianli, 2023 In order to reduce the dependence of the microgrid on the external system and the operating cost of the microgrid itself, a three-layer energy optimization strategy is proposed for the combined heat and power microgrid cluster.
Kai LING +6 more
doaj +1 more source
Fully dynamic all-pairs shortest paths with worst-case update-time revisited
, 2016 We revisit the classic problem of dynamically maintaining shortest paths between all pairs of nodes of a directed weighted graph. The allowed updates are insertions and deletions of nodes and their incident edges.
Abraham, Ittai +2 more
core +1 more source
Floyd-Warshall Algorithm in Shortest Path Optimizations: Example of Logistics Centers
Demiryolu Mühendisliği, 2022 Logistics centers are important facilities which served possible transportation methods together and and carried out activities in harmony with each other such as transportation, storage, handling, distribution, consolidation, customs clearance, sorting,
Bekir Keskin, E. Özcan
semanticscholar +1 more source
Networks, Volume 86, Issue 4, Page 361-388, December 2025.ABSTRACT The Split Delivery Vehicle Routing Problem with Two‐dimensional Loading Constraints (2L‐SDVRP) integrates vehicle routing, split delivery, and two‐dimensional packing constraints. In the 2L‐SDVRP, customers can be served by multiple vehicles, and their demands consist of different two‐dimensional rectangular items that must be packed in the ...
Kamyla Maria Ferreira +4 more
wiley +1 more source
The Metric Nearness Problem [PDF]
, 2008 Metric nearness refers to the problem of optimally restoring metric properties to distance measurements that happen to be nonmetric due to measurement errors or otherwise.
Brickell, Justin +3 more
core
Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
, 2016 The nested parallel (a.k.a. fork-join) model is widely used for writing parallel programs. However, the two composition constructs, i.e. "$\parallel$" (parallel) and "$;$" (serial), are insufficient in expressing "partial dependencies" or "partial ...
Dinh, David +2 more
core +1 more source