Greedy Gray codes for Dyck words and ballot sequences
V Vajnovszki, D Wong - International Computing and Combinatorics …, 2023 - Springer
We present a simple greedy algorithm for generating Gray codes for Dyck words and fixed-
weight Dyck prefixes. Successive strings in our listings differ from each other by a …
weight Dyck prefixes. Successive strings in our listings differ from each other by a …
Generating 2-Gray codes for ballot sequences in constant amortized time
D Wong, F Calero, K Sedhai - Discrete Mathematics, 2023 - Elsevier
We present a simple algorithm that generates a cyclic 2-Gray code for ballot sequences. The
algorithm generates each ballot sequence in constant amortized time using a linear amount …
algorithm generates each ballot sequence in constant amortized time using a linear amount …
PENDEKATAN BARISAN KOMBINATORIAL UNTUK PEMECAHAN MASALAH CAR SEQUENCING
A Sabri - Prosiding Seminar SeNTIK, 2024 - ejournal.jak-stik.ac.id
Masalah pengurutan mobil (car sequencing problem/CSP) adalah tentang bagaimana
menentukan urutan mobil pada jalur perakitan, di mana pada mobil-mobil ini akan dipasang …
menentukan urutan mobil pada jalur perakitan, di mana pada mobil-mobil ini akan dipasang …
Exhaustive Search for Weighted Ensemble Classifiers to Improve Performance on Imbalanced Dataset
T Handhika, A Sabri, Murni - … Conference on Artificial Intelligence and Big …, 2021 - Springer
We compare performance of six single classifiers trained on German credit dataset, an
imbalanced dataset of 1000 instances with binary-valued dependent variable. To improve …
imbalanced dataset of 1000 instances with binary-valued dependent variable. To improve …