Results 31 to 40 of about 130,220 (362)
The Covering Path Problem on a Grid [PDF]
Transportation Science, 2019 This paper introduces the covering path problem on a grid (CPPG) that finds the cost-minimizing path connecting a subset of points in a grid such that each point that needs to be covered is within a predetermined distance of a point from the chosen subset.
Liwei Zeng +2 more
openaire +2 more sources
Cost-Driven Scheduling of Grid Workflows Using Partial Critical Paths
IEEE Transactions on Parallel and Distributed Systems, 2012 S. Abrishami +2 more
semanticscholar +3 more sources
Investigation of Fast, Secure and Reliable Network Restoration after Blackouts
Energies, 2020 Integrating distributed generation into power grids creates various technical challenges for network operation. Volatility of renewable energy resources may increase the probability of blackouts.
Elmira Torabi Makhsos +9 more
doaj +1 more source
Algorithms for Smooth, Safe and Quick Routing on Sensor-Equipped Grid Networks
Sensors, 2021 Automation plays an important role in modern transportation and handling systems, e.g., to control the routes of aircraft and ground service equipment in airport aprons, automated guided vehicles in port terminals or in public transportation, handling ...
Giovanni Andreatta +2 more
doaj +1 more source
Hierarchical path-finding for Navigation Meshes (HNA*) [PDF]
, 2016 Path-finding can become an important bottleneck as both the size of the virtual environments and the number of agents navigating them increase. It is important to develop techniques that can be efficiently applied to any environment independently of its ...
Fuentes, Carlos +1 more
core +2 more sources
Counting Maximal Distance-Independent Sets in Grid Graphs
Discussiones Mathematicae Graph Theory, 2013 Previous work on counting maximal independent sets for paths and certain 2-dimensional grids is extended in two directions: 3-dimensional grid graphs are included and, for some/any ℓ ∈ N, maximal distance-ℓ independent (or simply: maximal ℓ-independent ...
Euler Reinhardt +2 more
doaj +1 more source
Rotation Grids for Improved Electrical Properties of Inkjet-Printed Strain Gauges
Sensors, 2022 We report an image data driven approach for inkjet printing (IJP) to improve the electrical properties of printed metallic strain gauges (SGs). The examined SGs contain narrow conducting paths of multiple orientations and therefore suffer from two ...
Matthias Rehberger +4 more
doaj +1 more source
A Hierarchical Routing Scheme With Load Balancing in Software Defined Vehicular Ad Hoc Networks
IEEE Access, 2018 The vast majority of routing approaches for vehicular ad hoc networks (VANETs) are distributed, which are ineffective to exploit the global networking information and easily lead to local optimum, appearing as sparse connectivity and network congestion ...
Yangshui Gao +4 more
doaj +1 more source
Generating Robust and Efficient Networks Under Targeted Attacks [PDF]
, 2015 Much of our commerce and traveling depend on the efficient operation of large scale networks. Some of those, such as electric power grids, transportation systems, communication networks, and others, must maintain their efficiency even after several ...
CM Schneider +4 more
core +2 more sources
Oriented Chromatic Number of Cartesian Products and Strong Products of Paths
Discussiones Mathematicae Graph Theory, 2019 An oriented coloring of an oriented graph G is a homomorphism from G to H such that H is without selfloops and arcs in opposite directions. We shall say that H is a coloring graph.
Dybizbański Janusz, Nenca Anna
doaj +1 more source