4 citations · 7 across the 5 of their papers we have counts for
7 papers
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…
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…
Nearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time
Alper Kose, Noyan Evirgen, Hakan Gokcesu +2
In this paper, we address the scheduling problem in wireless ad hoc networks by exploiting the computational advantage that comes when such scheduling problems can be represented b…
An Asymptotically Optimal Algorithm for Communicating Multiplayer Multi-Armed Bandit Problems
Noyan Evirgen, Alper Kose, Hakan Gokcesu
We consider a decentralized stochastic multi-armed bandit problem with multiple players. Each player aims to maximize his/her own reward by pulling an arm. The arms give rewards ba…
Performance Comparison of Algorithms for Movie Rating Estimation
Alper Kose, Can Kanbak, Noyan Evirgen
In this paper, our goal is to compare performances of three different algorithms to predict the ratings that will be given to movies by potential users where we are given a user-mo…
The Effect of Communication on Noncooperative Multiplayer Multi-Armed Bandit Problems
Noyan Evirgen, Alper Kose
We consider decentralized stochastic multi-armed bandit problem with multiple players in the case of different communication probabilities between players. Each player makes a deci…