|
|
|
|
|
Mattia Neroni, Massimo Bertolini and Angel A. Juan
In automated storage and retrieval systems (AS/RSs), the utilization of intelligent algorithms can reduce the makespan required to complete a series of input/output operations. This paper introduces a simulation optimization algorithm designed to minimiz...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dthenifer Cordeiro Santana, Gustavo de Faria Theodoro, Ricardo Gava, João Lucas Gouveia de Oliveira, Larissa Pereira Ribeiro Teodoro, Izabela Cristina de Oliveira, Fábio Henrique Rojo Baio, Carlos Antonio da Silva Junior, Job Teixeira de Oliveira and Paulo Eduardo Teodoro
Using multispectral sensors attached to unmanned aerial vehicles (UAVs) can assist in the collection of morphological and physiological information from several crops. This approach, also known as high-throughput phenotyping, combined with data processin...
ver más
|
|
|
|
|
|
|
|
|
|
|
Stanislav Marochok and Pavol Zajac
Cryptographic S-boxes are vectorial Boolean functions that must fulfill strict criteria to provide security for cryptographic algorithms. There are several existing methods for generating strong cryptographic S-boxes, including stochastic search algorith...
ver más
|
|
|
|
|
|
|
|
|
|
|
Batuhan Arasli and Sennur Ulukus
Group testing idea is an efficient approach to detect prevalence of an infection in the test samples taken from a group of individuals. It is based on the idea of pooling the test samples and performing tests to the mixed samples. This approach results i...
ver más
|
|
|
|
|
|
|
|
|
|
|
Siriwan Intawichai and Saifon Chaturantabut
An accelerated least-squares approach is introduced in this work by incorporating a greedy point selection method with randomized singular value decomposition (rSVD) to reduce the computational complexity of missing data reconstruction. The rSVD is used ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Franz Aurenhammer, Christoph Ladurner and Michael Steinkogler
We show that the so-called motorcycle graph of a planar polygon can be constructed by a randomized incremental algorithm that is simple and experimentally fast. Various test data are given, and a clustering method for speeding up the construction is prop...
ver más
|
|
|
|
|
|
|
|
|
|
|
Christoph Laroque, Madlene Leißau, Pedro Copado, Christin Schumacher, Javier Panadero and Angel A. Juan
Based on a real-world application in the semiconductor industry, this article models and discusses a hybrid flow shop problem with time dependencies and priority constraints. The analyzed problem considers a production where a large number of heterogeneo...
ver más
|
|
|
|
|
|
|
|
|
|
|
Max Bannach and Sebastian Berndt
Research on the similarity of a graph to being a tree?called the treewidth of the graph?has seen an enormous rise within the last decade, but a practically fast algorithm for this task has been discovered only recently by Tamaki (ESA 2017). It is based o...
ver más
|
|
|
|
|
|
|
|
|
|
|
Juliana Castaneda, Mattia Neroni, Majsa Ammouriova, Javier Panadero and Angel A. Juan
Many real-life combinatorial optimization problems are subject to a high degree of dynamism, while, simultaneously, a certain level of synchronization among agents and events is required. Thus, for instance, in ride-sharing operations, the arrival of veh...
ver más
|
|
|
|
|
|
|
|
|
|
|
Anna Kirkpatrick, Chidozie Onyeze, David Kartchner, Stephen Allegri, Davi Nakajima An, Kevin McCoy, Evie Davalbhakta and Cassie S. Mitchell
Literature-based discovery (LBD) summarizes information and generates insight from large text corpuses. The SemNet framework utilizes a large heterogeneous information network or ?knowledge graph? of nodes and edges to compute relatedness and rank concep...
ver más
|
|
|
|
|
|