Search Results for author:
Found 8 papers, 2 papers with code
Double-Ended Palindromic Trees: A Linear-Time Data Structure and Its Applications
eertree) is a linear-size data structure that provides access to all palindromic substrings of a string.
Hybrid Beamforming for mmWave MU-MISO Systems Exploiting Multi-agent Deep Reinforcement Learning
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.
Quantum Algorithm for Lexicographically Minimal String Rotation
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
Improving Positive Unlabeled Learning: Practical AUL Estimation and New Training Method for Extremely Imbalanced Data Sets
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.
PrecoderNet: Hybrid Beamforming for Millimeter Wave Systems with Deep Reinforcement Learning
In this letter, we investigate the hybrid beamforming for millimeter wave massive multiple-input multiple-output (MIMO) system based on deep reinforcement learning (DRL).
Prioritized Guidance for Efficient Multi-Agent Reinforcement Learning Exploration
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
Equivalence Checking of Quantum Finite-State Machines
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
Equivalence Checking of Sequential Quantum Circuits
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
