
Simplifying Reinforced Feature Selection via Restructured Choice Strategy of Single Agent
Feature selection aims to select a subset of features to optimize the pe...
read it

Disentangled NonLocal Neural Networks
The nonlocal block is a popular module for strengthening the context mo...
read it

On the Mathematical Understanding of ResNet with Feynman Path Integral
In this paper, we aim to understand Residual Network (ResNet) in a scien...
read it

An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs
This paper proposes a novel branchandbound(BMWVC) algorithm to exactly...
read it

Diversified Topk Partial MaxSAT Solving
We introduce a diversified topk partial MaxSAT problem, a combination o...
read it

Local Search for Minimum Weight Dominating Set with TwoLevel Configuration Checking and Frequency Based Scoring Function
The Minimum Weight Dominating Set (MWDS) problem is an important general...
read it

Augmenting Ordered Binary Decision Diagrams with Conjunctive Decomposition
This paper augments OBDD with conjunctive decomposition to propose a gen...
read it

Approximate Counting CSP Solutions Using Partition Function
We propose a new approximate method for counting the number of the solut...
read it

Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems
In this paper, we investigate the hybrid tractability of binary Quantifi...
read it

Phase Transitions in Knowledge Compilation: an Experimental Study
Phase transitions in many complex combinational problems have been widel...
read it

New WorstCase Upper Bound for X3SAT
The rigorous theoretical analyses of algorithms for exact 3satisfiabili...
read it

WorstCase Upper Bound for (1, 2)QSAT
The rigorous theoretical analysis of the algorithm for a subclass of QSA...
read it

New WorstCase Upper Bound for #XSAT
An algorithm running in O(1.1995n) is presented for counting models for ...
read it

Counting Solutions of Constraint Satisfiability Problems:Exact Phase Transitions and Approximate Algorithm
The study of phase transition phenomenon of NP complete problems plays a...
read it

Phase Transitions of Plan Modification in Conformant Planning
We explore phase transitions of plan modification, which mainly focus on...
read it

New worst upper bound for #SAT
The rigorous theoretical analyses of algorithms for #SAT have been propo...
read it
Minghao Yin
is this you? claim profile
Professor at Northeast Normal University · School of Computer Science and Information Technology