Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Oruc, A. Yavuz"'
Autor:
Shah, Syed Asad, Oruç, A. Yavuz
This paper introduces a simplified quantum Petri net (QPN) model and uses this model to generalize classical SISO, SIMO, MISO, MIMO and priority buffers to their quantum counterparts. It provides a primitive storage element, namely a quantum S-R flip
Externí odkaz:
http://arxiv.org/abs/2408.08369
Autor:
Atmaca, Abdullah, Oruc, A. Yavuz
Let $I$ and $O$ denote two sets of vertices, where $I\cap O =\emptyset$, $|I| = n$, $|O| = r$, and $B_u(n,r)$ denote the set of unlabeled graphs whose edges connect vertices in $I$ and $O$. Recently, it was established in\cite{atmacaoruc2018} that th
Externí odkaz:
http://arxiv.org/abs/2402.08053
This paper introduces a versatile, multi-layered technology to help support teaching and learning core computer architecture concepts. This technology, called CodeAPeel is already implemented in one particular form to describe instruction processing
Externí odkaz:
http://arxiv.org/abs/2104.09502
Autor:
Unsal, Cem M., Oruc, A. Yavuz
We present quantum algorithms for routing concentration assignments on full capacity fat-and-slim concentrators, bounded fat-and-slim concentrators, and regular fat-and-slim concentrators. Classically, the concentration assignment takes $O(n)$ time o
Externí odkaz:
http://arxiv.org/abs/2103.09818
Autor:
An, Taeyoung, Oruc, A. Yavuz
The proliferation of number of processing elements (PEs) in parallel computer systems, along with the use of more extensive parallelization of algorithms causes the interprocessor communications dominate VLSI chip space. This paper proposes a new arc
Externí odkaz:
http://arxiv.org/abs/2011.11144
Autor:
Atmaca, Abdullah, Oruc, A. Yavuz
This paper solves a problem that was stated by M. A. Harrison in 1973~\cite{harrison1973number}. This problem, that has remained open since then is concerned with counting equivalence classes of $n\times r$ binary matrices under row and column permut
Externí odkaz:
http://arxiv.org/abs/1705.01800
Autor:
Oruc, A. Yavuz, Atmaca, Abdullah
A frequently encountered problem in peer review systems is to facilitate pairwise comparisons of a given set of proposals by as few as referees as possible. In [8], it was shown that, if each referee is assigned to review k proposals then ceil{n(n-1)
Externí odkaz:
http://arxiv.org/abs/0909.3533
Autor:
Oruc, A. Yavuz, Atmaca, Abdullah
In ordinal evaluations of proposals in peer review systems, a set of proposals is assigned to a fixed set of referees so as to maximize the number of pairwise comparisons of proposals under certain referee capacity and proposal subject constraints. I
Externí odkaz:
http://arxiv.org/abs/0908.3233
