|
|
|
|
|
Mugang Lin, Jianxin Wang, Qilong Feng and Bin Fu
In order to increase the potential kidney transplants between patients and their incompatible donors, kidney exchange programs have been created in many countries. In the programs, designing algorithms for the kidney exchange problem plays a critical rol...
ver más
|
|
|
|
|
|
|
|
|
|
|
Art J. R. Pelling and Ennes Sarradj
State-space models have been successfully employed for model order reduction and control purposes in acoustics in the past. However, due to the cubic complexity of the singular value decomposition, which makes up the core of many subspace system identifi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mario Andrés Muñoz and Michael Kirley
In this paper, we investigate how systemic errors due to random sampling impact on automated algorithm selection for bound-constrained, single-objective, continuous black-box optimization. We construct a machine learning-based algorithm selector, which u...
ver más
|
|
|
|
|
|
|
|
|
|
|
Napoleão Nepomuceno, Ricardo Barboza Saboia and Plácido Rogério Pinheiro
In the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), customers demanding both delivery and pickup operations have to be visited once by a single vehicle. In this work, we propose a fast randomized algorithm using a nearest neigh...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jun Xie, Qingyun Yu and Chi Cao
In this paper, a distributed randomized gradient-free algorithm (DRGF) is employed to solve the complex non-convex economic dispatch problem whose non-convex constraints include valve-point loading effects, prohibited operating zones, and multiple fuel o...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yuqi Liu, Chao Sun and Shouda Jiang
To construct an online kernel adaptive filter in a non-stationary environment, we propose a randomized feature networks-based kernel least mean square (KLMS-RFN) algorithm. In contrast to the Gaussian kernel, which implicitly maps the input to an infinit...
ver más
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Nada Chakhim, Mohamed Louzar, Abdellah Lamnii and Mohammed Alaoui
Diffuse optical tomography (DOT) is an emerging modality that reconstructs the optical properties in a highly scattering medium from measured boundary data. One way to solve DOT and recover the quantities of interest is by an inverse problem approach, wh...
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Lev Kazakovtsev, Ivan Rozhnov, Aleksey Popov and Elena Tovbis
The k-means problem is one of the most popular models in cluster analysis that minimizes the sum of the squared distances from clustered objects to the sought cluster centers (centroids). The simplicity of its algorithmic implementation encourages resear...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dimitris Fotakis, Loukas Kavouras and Lydia Zakynthinou
The Dynamic Facility Location problem is a generalization of the classic Facility Location problem, in which the distance metric between clients and facilities changes over time. Such metrics that develop as a function of time are usually called ?evolvin...
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
András Faragó and Zohre R. Mojaveri
The Disjoint Connecting Paths problem and its capacitated generalization, called Unsplittable Flow problem, play an important role in practical applications such as communication network design and routing. These tasks are NP-hard in general, but various...
ver más
|
|
|
|
|
|
|
|
|
|
|
Martin Kenyeres and Jozef Kenyeres
Determining the network size is a critical process in numerous areas (e.g., computer science, logistic, epidemiology, social networking services, mathematical modeling, demography, etc.). However, many modern real-world systems are so extensive that meas...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mathias Kühn, Michael Völker and Thorsten Schmidt
Project Planning and Control (PPC) problems with stochastic job processing times belong to the problem class of Stochastic Resource-Constrained Multi-Project Scheduling Problems (SRCMPSP). A practical example of this problem class is the industrial domai...
ver más
|
|
|
|
|
|
|
|
|
|
|
Giao N. Pham, Son T. Ngo, Anh N. Bui, Dinh V. Tran, Suk-Hwan Lee and Ki-Ryong Kwon
In recent years, GIS (Geographical Information System) vector maps are widely used in everyday life, science, and the military. However, the production process of vector maps is expensive, and a large volume of vector map data is easily stolen and illega...
ver más
|
|
|
|
|
|