Results 181 to 190 of about 1,569,721 (239)

Flagellum Pumping Efficiency in Shear-Thinning Viscoelastic Fluids. [PDF]

J Fluid Mech
Barrett A, Fogelson AL, Gregory Forest M, Gruninger C, Lim S, Griffith BE.   +5 more
europepmc   +1 more source

Simulation Models for Exploring Magnetic Reconnection. [PDF]

Space Sci Rev
Shay M, Adhikari S, Beesho N, Birn J, Büchner J, Cassak P, Chen LJ, Chen Y, Cozzani G, Drake J, Guo F, Hesse M, Jain N, Pfau-Kempf Y, Lin Y, Liu YH, Oka M, Omelchenko Y, Palmroth M, Pezzi O, Reiff PH, Swisdak M, Toffoletto F, Toth G, Wolf RA.   +24 more
europepmc   +1 more source

Cosserat Rod-Based Tendon Friction Modeling, Simulation, and Experiments for Tendon-Driven Continuum Robots. [PDF]

Micromachines (Basel)
Wang H, Du J, Mao Y.
europepmc   +1 more source

A Framework to Simulate Friction Stir Additive Manufacturing (FSAM) Using the Finite Element Method. [PDF]

Micromachines (Basel)
Meyghani B, Teimouri R.
europepmc   +1 more source

When shop scheduling meets dominoes, eulerian and hamiltonian paths

, 2017
Jean‐Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent t'Kindt   +3 more
openalex   +1 more source

Revisiting Tundish Flow Characterization: A Combined Eulerian-Lagrangian Study on the Effects of Dams, Baffles, and Side-Wall Inclination. [PDF]

Materials (Basel)
Mostafazade Abolmaali A, Bayat M, Nadimpalli VK, Dahmen T, Hattel J.   +4 more
europepmc   +1 more source

Eulerian path methods for multiple sequence alignment [PDF]

Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003, 2003
With the rapid increase in the size of genome sequence databases, the multiple sequence alignment problem is increasingly important and often requires the alignment of a large number of sequences. Beginning in 1975, many heuristic algorithms have been created to improve the speed of computation and the quality of alignment.
M. Waterman, Yu Zhang
semanticscholar   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Enumerating Eulerian Trails via Hamiltonian Path Enumeration

Workshop on Algorithms and Computation, 2015
Given an undirected graph G, we consider enumerating all Eulerian trails, that is, walks containing each of the edges in G just once. We consider achieving it with the enumeration of Hamiltonian paths with the zero-suppressed decision diagram (ZDD), a data structure that can efficiently store a family of sets satisfying given conditions.
H. Hanada, Shuhei Denzumi, Yuma Inoue, Hiroshi Aoki, Norihito Yasuda, Shogo Takeuchi, S. Minato   +6 more
semanticscholar   +2 more sources