Omnidirectional-Wheel Conveyor Path Planning and Sorting Using Reinforcement Learning Algorithms
In this paper, path planning and sorting of packages for Omnidirectional-Wheel conveyor are presented using Reinforcement Learning (RL). Q-learning, Double Q-learning, Deep Q-learning, and the Double Deep Q-learning algorithms are investigated.
Walid Zaher +4 more
doaj +1 more source
Feature extraction using extrema sampling of discrete derivatives for spike sorting in implantable upper-limb neural prostheses [PDF]
Next generation neural interfaces for upper-limb (and other) prostheses aim to develop implantable interfaces for one or more nerves, each interface having many neural signal channels that work reliably in the stump without harming the nerves. To achieve
Demosthenous, A +3 more
core +1 more source
Desnakification of Mesh Sorting Algorithms [PDF]
In all recent near-optimal sorting algorithms for meshes, the packets are sorted with respect to some snake-like indexing. In this paper we present deterministic algorithms for sorting with respect to the more natural row-major indexing.
Sibeyn, J., Jop F. Sibeyn
core +1 more source
Study of the efficiency of some deterministic preprocessing methods for sorting algorithms
To verify the hypothesis about decrease in time of sorting by algorithms of different computational complexity experiments have been conducted. Several ideas on deterministic preprocessing of data arrays for sorting algorithms have been tested.
Makarov, O.V., Shynkarenko, V.I.
core
Topological sorting algorithms [PDF]
Topological Sorting is a standard computation performed on finite partial order relations, for which efficient algorithms are well known. This work is a study of using a depth-first search of a directed graph to implement topological sorting algorithms ...
Albert, Joseph
core +6 more sources
Comparison Of Hybrid Sorting Algorithms Implemented On Different Parallel Hardware Platforms
Sorting is a common problem in computer science. There are lot of well-known sorting algorithms created for sequential execution on a single processor. Recently, hardware platforms enable to create wide parallel algorithms.
Dominik Zurek +3 more
doaj +1 more source
Peripheral lysosomes recruit PLEKHG3 to focal adhesions and restrain protrusion dynamics
Proximity‐dependent labeling at the LAMTOR complex revealed the Rho GEF PLEKHG3 as a lysosome‐proximal protein directing the study toward the influence of lysosome positioning on actin dynamics and cell motility. We show that PLEKHG3 colocalizes with lysosomes at focal adhesion sites and observe that forced peripheral dispersion of lysosomes hinders ...
Rainer Ettelt +8 more
wiley +1 more source
Golgi enzymes are retrieved from the plasma membrane to the trans‐Golgi network
Golgi enzymes are traditionally considered resident proteins retained within the Golgi apparatus. Here, we demonstrate that a subset transiently reaches the cell surface and is subsequently retrieved to the trans‐Golgi network via retrograde transport. Using a nanobody‐based toolkit, we uncover a dynamic trafficking cycle of several Golgi enzymes.
Dominik P. Buser, Tina Junne
wiley +1 more source
The Folklore of Sorting Algorithms [PDF]
The objective of this paper is to review the folklore knowledge seen in research work devoted on synthesis, optimization, and effectiveness of various sorting algorithms.
Khamitka, Santosh +3 more
core
Perbandingan Efisiensi Algoritma Sorting dalam Penggunaan Bandwidth
The most used algorithm is the sorting algorithm. There have been many popping sorting algorithms that can be used, in this study researchers took three sorting algorithms namely Insertion Sort, Selection Sort, and Merge Sort.
Desi Anggreani +3 more
doaj +1 more source

