Results 221 to 230 of about 2,474,612 (263)
Advanced Materials, EarlyView.A chemically defined PEG‐based microgel platform enables scalable, reproducible production of three‐dimensional microgel‐iPSC constructs in multiple sizes. The system is compatible with high‐throughput automation and supports human iPSC expansion and differentiation within a single construct, including directed differentiation into cardiac organoids ...
Laura Klasen +8 more
wiley +1 more source
Fiber‐Format Flexible Linear Electrostatic Motors
Advanced Materials, EarlyView.A flexible coaxial fibre‐format electrostatic motor enables backdrivable and reversible linear actuation with high force density and functionality under bending, offering a scalable actuation platform for soft and wearable robotics. ABSTRACT Linear motion is fundamental to robotics, yet existing solutions are either rigid electromagnetic motors or ...
Sylvain Schaller, Herbert Shea
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Graphs and Combinatorics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shi-Cai Gong, Jia-Xin Wang, Shao-Wei Sun
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shi-Cai Gong, Jia-Xin Wang, Shao-Wei Sun
openaire +3 more sources
Graph signatures: Identification and optimization
European Journal of Operational Research, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Balabhaskar Balasundaram +2 more
openaire +2 more sources
The Optimal Partitioning of Graphs
SIAM Journal on Applied Mathematics, 1976The problem considered in this paper is that of partitioning a link-weighted graph G into two parts, each of which is constrained in size by the (given) maximum number of vertices that the part can contain. This is a special case of the general partitioning problem of a graph into k parts with size constraints, which appears in a number of very diverse
Christofides, Nicos, Brooker, P.
openaire +1 more source
Bell System Technical Journal, 1975
Many important properties of switching networks can be effectively studied in the more general context of graph theory. In particular, the various rearrangeability properties of a network fall into this category. If G is a graph with vertex set V = I ∪ Ω, we say G is rearrangeable if, for all choices of distinct vertices, i 1 , i 2 , …, i 1 in I and j
openaire +3 more sources
Many important properties of switching networks can be effectively studied in the more general context of graph theory. In particular, the various rearrangeability properties of a network fall into this category. If G is a graph with vertex set V = I ∪ Ω, we say G is rearrangeable if, for all choices of distinct vertices, i 1 , i 2 , …, i 1 in I and j
openaire +3 more sources
Random Graphs and Graph Optimization Problems
SIAM Journal on Computing, 1980One major difficulty in analyzing algorithms for graph optimization problems is that the probabilistic behavior of the optimum solutions to most of the important problems is generally unknown. We present a general method for relating some well-known results regarding the probability of existence of certain subgraphs in random graphs to the ...
openaire +2 more sources
Graph Optimal Monomorphism Algorithms
IEEE Transactions on Systems, Man, and Cybernetics, 1980The characterization of graph morphisms in terms of the subgraphs of the Cartesian graph product is extended and used to develop algorithms for an optimal graph monomorphism problem. The objective functional considered is defined as the sum of the weights associated with vertex and arc mappings.
David Ghahraman +2 more
openaire +2 more sources
Information Processing Letters, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jeng-Jung Wang +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jeng-Jung Wang +2 more
openaire +2 more sources