Results 221 to 230 of about 383,776 (277)
This paper presents a digital microfluidics‐based technique for transferring and reconfiguring soft nanomembranes. Laser‐machined nanothin membranes are picked up, transported, and aligned via tailored surface tension and the actuation of water droplets, enabling the development of flexible electronics, the integration of functional materials on 3D ...
Quang Anh Nguyen +15 more
wiley +1 more source
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. [PDF]
Bentert M, Fomin FV, Golovach PA.
europepmc +1 more source
The repair and regeneration of brain tissue faces both biological and technical challenges. Injectable bioscaffolds offer new opportunities to stimulate tissue regrowth in the brain by recruiting neural stem cells. Here, the translational issues are reviewed that need to be address to advance this promising new therapeutic approach from the bench to ...
Michel Modo, Alena Kisel
wiley +1 more source
Community structure unveils the path multiplicity in complex networks. [PDF]
Deng Y +7 more
europepmc +1 more source
IRN2Vec: A representation learning model for road network intersections by integrating geospatial attributes and travel behaviors. [PDF]
Yang X.
europepmc +1 more source
Harary index of the zero divisor graph of upper triangular matrices. [PDF]
Alshanqiti O, Sharma S, Bhat VK.
europepmc +1 more source
The effect of levodopa on speech graphs in non-demented patients with multiple system atrophy and Parkinson's disease. [PDF]
Liu J, Zhao Y, Ma J, Zhang G.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
International Journal of Computational Geometry & Applications, 1996We present an algorithm for determining the shortest path between any two points along the surface of a polyhedron which need not be convex. This algorithm also computes for any source point on the surface of a polyhedron the inward layout and the subdivision of the polyhedron which can be used for processing queries of shortest paths between the ...
Chen, Jindong, Han, Yijie
openaire +1 more source
2008
Shortest path problems are fundamental network optimization problems arising in many contexts and having a wide range of applications, including dynamic programming, project management, knapsack problems, routing in data networks, and transportation problems.
openaire +2 more sources
Shortest path problems are fundamental network optimization problems arising in many contexts and having a wide range of applications, including dynamic programming, project management, knapsack problems, routing in data networks, and transportation problems.
openaire +2 more sources
Dynamic shortest‐path interdiction
Networks, 2016We study a dynamic network game between an attacker and a user. The user wishes to find a shortest path between a pair of nodes in a directed network, and the attacker seeks to interdict a subset of arcs to maximize the user's shortest‐path cost. In contrast to most previous studies, the attacker can interdict arcs any time the user reaches a node in ...
Sefair, Jorge A., Smith, J. Cole
openaire +1 more source

