Results 51 to 60 of about 10,050 (224)
Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming
Sabreen Mahmood Shukr +2 more
doaj +1 more source
Octagonal Domains for Continuous Constraints [PDF]
International audienceDomains in Continuous Constraint Programming (CP) are generally represented with intervals whose $n$-ary Cartesian product (box) approximates the solution space.
Benhamou, Frédéric +2 more
core +3 more sources
The ability to quickly calculate or query the shortest path distance between nodes on a road network is essential for many real-world applications. However, the traditional graph traversal shortest path algorithm methods, such as Dijkstra and Floyd ...
Xu Chen +6 more
doaj +1 more source
Measuring shoot length of submerged aquatic plants using graph analysis [PDF]
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
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
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
A balancing system for liquid metal batteries using the Floyd-Warshall algorithm
Lei Fan +6 more
openaire +2 more sources
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
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
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
The main objective of this paper is to find the duration of maximum time connectivity of sensor nodes under uncertainty utilizing the prespecified voltage/power of each sensor node. Wireless sensor networks (WSNs) are composed of nodes that transmit data between each other over routing.
Laxminarayan Sahoo +4 more
openaire +3 more sources

