no code implementations • 5 Oct 2022 • Qisheng Wang, Ming Yang, Xinrui Zhu
eertree) is a linear-size data structure that provides access to all palindromic substrings of a string.
no code implementations • 1 Feb 2021 • Qisheng Wang, Xiao Li, Shi Jin, Yijiain Chen
In this letter, we investigate the hybrid beamforming based on deep reinforcement learning (DRL) for millimeter Wave (mmWave) multi-user (MU) multiple-input-single-output (MISO) system.
no code implementations • 17 Dec 2020 • Qisheng Wang, Mingsheng Ying
Lexicographically minimal string rotation (LMSR) is a problem to find the minimal one among all rotations of a string in the lexicographical order, which is widely used in equality checking of graphs, polygons, automata and chemical structures.
Quantum Physics Computational Complexity Data Structures and Algorithms
no code implementations • 21 Apr 2020 • Liwei Jiang, Dan Li, Qisheng Wang, Shuai Wang, Songtao Wang
Secondly, we propose ProbTagging, a new training method for extremely imbalanced data sets, where the number of unlabeled samples is hundreds or thousands of times that of positive samples.
no code implementations • 31 Jul 2019 • Qisheng Wang, Keming Feng, Xiao Li, Shi Jin
In this letter, we investigate the hybrid beamforming for millimeter wave massive multiple-input multiple-output (MIMO) system based on deep reinforcement learning (DRL).
no code implementations • 18 Jul 2019 • Qisheng Wang, Qichao Wang
Exploration efficiency is a challenging problem in multi-agent reinforcement learning (MARL), as the policy learned by confederate MARL depends on the collaborative approach among multiple agents.
Multi-agent Reinforcement Learning reinforcement-learning +1
1 code implementation • 8 Jan 2019 • Qisheng Wang, Junyi Liu, Mingsheng Ying
In this paper, we introduce the model of quantum Mealy machines and study the equivalence checking and minimisation problems of them.
Formal Languages and Automata Theory Quantum Physics
2 code implementations • 16 Nov 2018 • Qisheng Wang, Mingsheng Ying
This difficulty is resolved by our main theorem showing that equivalence checking of two quantum Mealy machines can be done with input sequences that are taken from some chosen basis (which are finite) and have a length quadratic in the dimensions of the state Hilbert spaces of the machines.
Quantum Physics