4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.AI2017★ 4 cited
Simulated Annealing Algorithm for Graph Coloring
Alper Kose, Berke Aral Sonmez, Metin Balaban
The goal of this Random Walks project is to code and experiment the Markov Chain Monte Carlo (MCMC) method for the problem of graph coloring. In this report, we present the plots o…
cs.IT2017
Study of the Sparse Superposition Codes and the Generalized Approximate Message Passing Decoder for the Communication over Binary Symmetric and Z Channels
Alper Kose, Berke Aral Sonmez
In this project, the behavior of Generalized Approximate Message-Passing Decoder for BSC and Z Channel is studied using i.i.d matrices for constructing the codewords. The performan…