|
|
|
|
|
Joseph B. Kadane
The maximum sum subarray problem is to find a contiguous subarray with the largest sum. The history of algorithms to address this problem is recounted, culminating in what is known as Kadane?s algorithm. However, that algorithm is not the algorithm Kadan...
ver más
|
|
|
|
|
|
|
|
|
|
|
Marcus R. Garvie and John Burkardt
The general problem of tiling finite regions of the plane with polyominoes is ????
NP
-complete, and so the associated computational geometry problem rapidly becomes intractable for large instances. Thus, the need to reduce algorithm complexity for tilin...
ver más
|
|
|
|
|
|
|
|
|
|
|
Michal Berlinski, Eryk Warchulski and Stanislaw Kozdrowski
This paper presents a logistics problem, related to the transport of goods, which can be applied in practice, for example, in postal or courier services. Two mathematical models are presented as problems occurring in a logistics network. The main objecti...
ver más
|
|
|
|
|
|
|
|
|
|
|
Lin Guo, Anand Balu Nellippallil, Warren F. Smith, Janet K. Allen and Farrokh Mistree
When dealing with engineering design problems, designers often encounter nonlinear and nonconvex features, multiple objectives, coupled decision making, and various levels of fidelity of sub-systems. To realize the design with limited computational resou...
ver más
|
|
|
|
|
|
|
|
|
|
|
Agostinho Agra and Jose Maria Samuco
Given a social network modelled by a graph, the goal of the influence maximization problem is to find k vertices that maximize the number of active vertices through a process of diffusion. For this diffusion, the linear threshold model is considered. A n...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dmitry Lukyanenko
The paper proposes a parallel algorithm for solving large overdetermined systems of linear algebraic equations with a dense matrix. This algorithm is based on the use of a modification of the conjugate gradient method, which is able to take into account ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Cheng Liu, Zhujun Si, Jun Hua and Na Jia
The problem of two-dimensional irregular packing involves the arrangement of objects with diverse shapes and sizes within a given area. This challenge arises across various industrial sectors, where effective packing optimization can yield cost savings, ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Eduardo J. Solteiro Pires, Adelaide Cerveira and José Baptista
This work addresses the wind farm (WF) optimization layout considering several substations. It is given a set of wind turbines jointly with a set of substations, and the goal is to obtain the optimal design to minimize the infrastructure cost and the cos...
ver más
|
|
|
|
|
|
|
|
|
|
|
Cao-Tri Dinh, Thinh Huynh and Young-Bok Kim
This study proposes a flying robot using waterpower and a novel weight-shifting mechanism, whose purpose is to be applied in firefighting tasks in water areas that are difficult to access and are suppressed by conventional firefighting methods. The suffi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yidong Chen, Chen Li and Zhonghua Lu
In this paper, we propose a parallel algorithm for a fund of fund (FOF) optimization model. Based on the structure of objective function, we create an augmented Lagrangian function and separate the quadratic term from the nonlinear term by the alternate ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Olga Kostyukova and Tatiana Tchemisova
In this paper, we continue an earlier study of the regularization procedures of linear copositive problems and present new algorithms that can be considered as modifications of the algorithm described in our previous publication, which is based on the co...
ver más
|
|
|
|
|
|
|
|
|
|
|
Khumbelo Muthavhine and Mbuyu Sumbwanyambe
Cryptographic algorithms installed on Internet of Things (IoT) devices suffer many attacks. Some of these attacks include the differential linear attack (DL). The DL attack depends on the computation of the probability of differential-linear characterist...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shih Yu Chang, Hsiao-Chun Wu and Yifan Wang
In order to perform big-data analytics, regression involving large matrices is often necessary. In particular, large scale regression problems are encountered when one wishes to extract semantic patterns for knowledge discovery and data mining. When a la...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ziping Wang, Tingqiu Li, Qiu Jin, Hao Guo, Ji Zhao and Junlin Qi
This paper proposes a fast multigrid algorithm to simulate the non-linear motion of ships in both intact and damaged conditions. The simulations of ship motions in waves are known to require much time to calculate due to the strong non-linear interaction...
ver más
|
|
|
|
|
|
|
|
|
|
|
Chuanwei Zhang, Shirui Chen, Lu Zhao, Xianghe Li and Xiaowen Ma
Conveyor belts are key pieces of equipment for bulk material transport, and they are of great significance to ensure safe operation. With the development of belt conveyors in the direction of long distances, large volumes, high speeds, and high reliabili...
ver más
|
|
|
|
|
|
|
|
|
|
|
Marco Reinaldi, Anak Agung Ngurah Perwira Redi, Dio Fawwaz Prakoso, Arrie Wicaksono Widodo, Mochammad Rizal Wibisono, Agus Supranartha, Rahmad Inca Liperda, Reny Nadlifatin, Yogi Tri Prasetyo and Sekar Sakti
A two echelon distribution system is often used to solve logistics problems. This study considers a two-echelon distribution system in reverse logistics context with the use of drop box facility as an intermediary facility. An optimization model of integ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Novalia Pertiwi, Fannush Shofi Akbar, Eko Setijadi, Gamantyo Hendrantoro
Pág. 9 - 16
In this paper, a thinned linear array with Cavity backed U-slot Patch has been investigated using the Genetic Algorithm to minimize peak sidelobe level and the number of antenna elements. One of the essential steps in the Genetic Algorithm method is a cr...
ver más
|
|
|
|
|
|
|
|
|
|
|
Novalia Pertiwi, Fannush Shofi Akbar, Eko Setijadi, Gamantyo Hendrantoro
Pág. 9 - 16
In this paper, a thinned linear array with Cavity backed U-slot Patch has been investigated using the Genetic Algorithm to minimize peak sidelobe level and the number of antenna elements. One of the essential steps in the Genetic Algorithm method is a cr...
ver más
|
|
|
|
|
|
|
|
|
|
|
Brona Brejová and Rastislav Královic
In the reconciliation problem, we are given two phylogenetic trees. A species tree represents the evolutionary history of a group of species, and a gene tree represents the history of a family of related genes within these species. A reconciliation maps ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Oleg Rudenko,Oleksandr Bezsonov,Oleh Lebediev,Valentyn Lebediev,Kiril Oliinyk
Pág. 37 - 46
This paper addresses the task of identifying the parameters of a linear object in the presence of non-Gaussian interference. The identification algorithm is a gradient procedure for minimizing the combined functional. The combined functional, in turn, co...
ver más
|
|
|
|
|
|