Results 101 to 110 of about 190,109 (292)
A Note on the Unsolvability of the Weighted Region Shortest Path Problem [PDF]
Let S be a subdivision of the plane into polygonal regions, where each region has an associated positive weight. The weighted region shortest path problem is to determine a shortest path in S between two points s, t in R^2, where the distances are ...
De Carufel, Jean-Lou +4 more
core
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n vertices and k crossings, where k is smaller than n by an iterated ...
Darren Strash +3 more
core +4 more sources
The study investigates novel semi‐finished products made of unidirectionally arranged hemp or pineapple leaf fiber‐reinforced composites produced from different matrices. The materials are analyzed in terms of their mechanical and interfacial properties and void content.
Nina Graupner +22 more
wiley +1 more source
The Shortest Path Problem for a Multiple Graph
In the article, the definition of an undirected multiple graph of any natural multiplicity k > 1 is stated. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is the union of k linked edges,
Alexander V. Smirnov
doaj +1 more source
The thermal diffusivity of MgO‐C refractories is highly sensitive to sample preparation and processing procedures. In this article, the effects of coking sequence, machining conditions, structural inhomogeneity, and graphite coating application on measurements using laser flash apparatus are systematically investigated.
Luyao Pan +4 more
wiley +1 more source
Fuzzy Rules for Ant Based Clustering Algorithm
This paper provides a new intelligent technique for semisupervised data clustering problem that combines the Ant System (AS) algorithm with the fuzzy c-means (FCM) clustering algorithm.
Amira Hamdi +3 more
doaj +1 more source
A new algorithm for calculating the most reliable pair of disjoint paths in a network
In various types telecommunication networks, namely mobile ad hoc networks, WDM networks and MPLS networks, there is the necessity of calculating disjoint paths for given node to node connections in order to increase the reliability of the services ...
Teresa Gomes +2 more
doaj +1 more source
The growing demand for lightweight, nontoxic, and multifunctional gamma shielding materials has intensified efforts to find alternatives to conventional lead and aluminum‐based protectants. In this work, we develop epoxy quartz fabric composites reinforced with cobalt chloride (CoCl2) microparticles, fabricated via hand lay‐up with varying filler ...
Summan Urooge +7 more
wiley +1 more source
Finding K shortest looping paths in a traffic-light network
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Hsu-Hao, Chen, Yen-Liang
openaire +3 more sources
Carbon nanomaterial‐reinforced epoxy composites exhibit pronounced piezoresistive behavior, enabling intrinsic damage sensing under cyclic and fatigue loading. This review critically compares carbon nanotube and graphene systems, correlating filler content, percolation threshold, and gauge factor with sensing stability and damage evolution.
J. M. Parente +3 more
wiley +1 more source

