|
|
|
|
|
Esra?a Alkafaween, Ahmad Hassanat, Ehab Essa and Samir Elmougy
The genetic algorithm (GA) is a well-known metaheuristic approach for dealing with complex problems with a wide search space. In genetic algorithms (GAs), the quality of individuals in the initial population is important in determining the final optimal ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tilo Strutz
This paper investigates the systematic and complete usage of k-opt permutations with k=2…6" role="presentation">??=2?6k=2?6
k
=
2
?
6
in application to local optimization of symmetric two-dimensional instances up to 107" role="presentation">1...
ver más
|
|
|
|
|
|
|
|
|
|
|
Raluca Chitic, Ali Osman Topal and Franck Leprévost
Recently, convolutional neural networks (CNNs) have become the main drivers in many image recognition applications. However, they are vulnerable to adversarial attacks, which can lead to disastrous consequences. This paper introduces ShuffleDetect as a n...
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Maria Mannone and Takashi Yoshino
Temari balls are traditional Japanese toys and artworks. The variety of their geometries and tessellations can be investigated formally and computationally with the means of combinatorics. As a further step, we also propose a musical application of the c...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xinyu Shi, Yuan Liang, Tyson Keen Phillips, Haining Zhou, Da Wan, Weijiu Cui and Weijun Gao
Although robotic spatial printing (RSP) has demonstrated a new way of fabricating building components with a good stiffness-to-weight ratio, the complexity of the applied geometries is still limited. Among them are branching geometries, which refer to th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Guilherme Henrique Santos Miranda, Alexsandro Oliveira Alexandrino, Carla Negri Lintzmayer and Zanoni Dias
Understanding how different two organisms are is one question addressed by the comparative genomics field. A well-accepted way to estimate the evolutionary distance between genomes of two organisms is finding the rearrangement distance, which is the smal...
ver más
|
|
|
|
|
|
|
|
|
|
|
Laurent Bulteau, Guillaume Fertin, Géraldine Jean and Christian Komusiewicz
A multi-cut rearrangement of a string S is a string ??'
S
'
obtained from S by an operation called k-cut rearrangement, that consists of (1) cutting S at a given number k of places in S, making S the concatenated string ??1·??2·??3·?·????·????+1
X
1
·
X...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sergey Kurapov,Maxim Davidovsky
Pág. 1 - 8
In general, a universal algorithm for testing a pair of graphs G and H for isomorphism exists. It is grounded on the fact that the rows and the corresponding columns of the adjacency matrix of the graph G can be rearranged until it turns into another, eq...
ver más
|
|
|
|
|
|