Results 211 to 220 of about 28,365 (265)

Exploring weighted network backbone extraction: A comparative analysis of structural techniques. [PDF]

PLoS One
Yassin A, Cherifi H, Seba H, Togni O.
europepmc   +1 more source

Backpropagation Through Soft Body: Investigating Information Processing in Brain–Body Coupling Systems

Advanced Robotics Research, EarlyView.
This study explores how information processing is distributed between brains and bodies through a codesign approach. Using the “backpropagation through soft body” framework, brain–body coupling agents are developed and analyzed across several tasks in which output is generated through the agents’ physical dynamics.
Hiroki Tomioka, Katsuma Inoue, Yasuo Kuniyoshi, Kohei Nakajima   +3 more
wiley   +1 more source

Computation of the Face Index of Certain Polycyclic Aromatic Hydrocarbons. [PDF]

ACS Omega
Parkash J, Negi S, Bhat VK.
europepmc   +1 more source

Machine Learning the Decoherence Property of Superconducting and Semiconductor Quantum Devices from Graph Connectivity. [PDF]

Entropy (Basel)
Fu Q, Liu J, Wang X, Xiong R.
europepmc   +1 more source

Determining the Upper-Bound on the Code Distance of Quantum Stabilizer Codes Through the Monte Carlo Method Based on Fully Decoupled Belief Propagation. [PDF]

Entropy (Basel)
Liang Z, Wang Z, Yi Z, Yang F, Wang X.
europepmc   +1 more source

Efficient Hybrid Environment Expression for Look-and-Step Behavior of Bipedal Walking. [PDF]

Cyborg Bionic Syst
Li C, Li Q, Lai J, Chen X, Yu Z, Jiang Z.   +5 more
europepmc   +1 more source

Optical Blaster: Launching Nanostructured Microrockets out of an Optical Trap by a Single Laser Beam. [PDF]

ACS Nano
Ussembayev Y, Arakawa Y, Beunis F, Spoelstra AB, Bus T, Schenning APHJ, Neyts K.   +6 more
europepmc   +1 more source

Persistence diagrams as morphological signatures of cells: A method to measure and compare cells within a population. [PDF]

PLoS Comput Biol
Bokor Bleile Y, Yadav P, Koehl P, Rehfeldt F.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Planar Bus Graphs

Algorithmica, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruckdorfer, Till, Felsner, Stefan, Kaufmann, Michael   +2 more
openaire   +1 more source

Partitioning Planar Graphs

SIAM Journal on Computing, 1992
The graph partitioning problem is the problem of dividing a given graph of \(n\) nodes into two sets of prescribed size while cutting a minimum number of edges. The authors show that the partitioning problem of a planar graph can be solved in polynomial time if the cutsize of the optimal partition is \(O(\log n)\) or if an embedding of the graph is ...
Bui, Thang Nguyen, Peck, Andrew
openaire   +2 more sources