Search Results for author:
Found 11 papers, 2 papers with code
A Fast Algorithm for Computing the Deficiency Number of a Mahjong Hand
Face-to-face or online, each player begins with a hand of 13 tiles and players draw and discard tiles in turn until they complete a winning hand.
A Tensor Network based Decision Diagram for Representation of Quantum Circuits
Tensor networks have been successfully applied in simulation of quantum physical systems for decades.
Quantum Physics Data Structures and Algorithms
Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
Mapping logical quantum circuits to Noisy Intermediate-Scale Quantum (NISQ) devices is a challenging problem which has attracted rapidly increasing interests from both quantum and classical computing communities.
Quantum Physics
Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search
Our algorithm runs in time polynomial in all parameters including the size and the qubit number of the input circuit, and the qubit number in the QPU.
Quantum Physics
Multiagent Simple Temporal Problem: The Arc-Consistency Approach
The Simple Temporal Problem (STP) is a fundamental temporal reasoning problem and has recently been extended to the Multiagent Simple Temporal Problem (MaSTP).
Exploring Directional Path-Consistency for Solving Constraint Networks
Among the local consistency techniques used for solving constraint networks, path-consistency (PC) has received a great deal of attention.
On Distributive Subalgebras of Qualitative Spatial and Temporal Calculi
This paper first gives a characterisation of distributive subalgebras, which states that the intersection of a set of $n\geq 3$ relations in the subalgebra is nonempty if and only if the intersection of every two of these relations is nonempty.
Realizing RCC8 networks using convex regions
First, we identify all ways in which the set of RCC8 base relations can be restricted to guarantee that consistent networks can be convexly realized in respectively 1D, 2D, 3D, and 4D.
On Redundant Topological Constraints
In this paper, we show that this problem is in general intractable, but becomes tractable if $\Gamma$ is over a tractable subalgebra $\mathcal{S}$ of a qualitative calculus.
On the Internal Topological Structure of Plane Regions
The study of topological information of spatial objects has for a long time been a focus of research in disciplines like computational geometry, spatial reasoning, cognitive science, and robotics.
