|
|
|
|
|
Eugene Levner, Vladimir Kats, Pengyu Yan and Ada Che
High-throughput screening systems are robotic cells that automatically scan and analyze thousands of biochemical samples and reagents in real time. The problem under consideration is to find an optimal cyclic schedule of robot moves that ensures maximum ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mauro Dell?Amico, Jafar Jamal and Roberto Montemanni
The minimum-cost arborescence problem is a well-studied problem. Polynomial-time algorithms for solving it exist. Recently, a new variation of the problem called the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times was presente...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 12
In some previous publications, we investigated the properties of a special binary relation, which was sometimes called the equivalence relation at infinity. For a pair of finite languages, the equality of infinite iterations of these langu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sílvia de Castro Pereira, Eduardo J. Solteiro Pires and Paulo B. de Moura Oliveira
A new algorithm based on the ant colony optimization (ACO) method for the multiple traveling salesman problem (mTSP) is presented and defined as ACO-BmTSP. This paper addresses the problem of solving the mTSP while considering several salesmen and keepin...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sihan Chen, Changqing Zhang and Jiaping Yi
Woodworking manipulators are applied in wood processing to promote automatic levels in the wood industry. However, traditional trajectory planning results in low operational stability and inefficiency. Therefore, we propose a method combining 3-5-3 piece...
ver más
|
|
|
|
|
|
|
|
|
|
|
Peng Lyu, Jeongik Min and Juwhan Song
A non-invasive automatic broiler weight estimation and prediction method based on a machine learning algorithm was developed to address the issue of high labor costs and stress responses caused by the traditional broiler weighing method in large-scale br...
ver más
|
|
|
|
|
|
|
|
|
|
|
Svetlana A. Krasnova, Julia G. Kokunko, Sergey A. Kochetkov and Victor A. Utkin
Planning an achievable trajectory for a mobile robot usually consists of two steps: (i) finding a path in the form of a sequence of discrete waypoints and (ii) transforming this sequence into a continuous and smooth curve. To solve the second problem, th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Clara Letessier, Jean Cardi, Antony Dussel, Isa Ebtehaj and Hossein Bonakdari
Given that the primary cause of flooding in Ontario, Canada, is attributed to spring floods, it is crucial to incorporate temperature as an input variable in flood prediction models with machine learning algorithms. This inclusion enables a comprehensive...
ver más
|
|
|
|
|
|
|
|
|
|
|
Indulekha Thekkethuruthel Sadanandan and Bhadrachalam Chitturi
Sorting permutations with various operations has applications in genetics and computer interconnection networks where an operation is specified by its generator set. A transposition tree ??=(??,??)
T
=
(
V
,
E
)
is a spanning tree over n vertices ??1,??...
ver más
|
|
|
|
|
|
|
|
|
|
|
Anuj Jain and Sartaj Sahni
The min-wait foremost, min-hop foremost and min-cost foremost paths and walks problems in interval temporal graphs are considered. We prove that finding min-wait foremost and min-cost foremost walks and paths in interval temporal graphs is NP-hard. We de...
ver más
|
|
|
|
|
|