research
∙
01/31/2023
A Counterfactual Collaborative Session-based Recommender System
Most session-based recommender systems (SBRSs) focus on extracting infor...
share
research
∙
01/01/2023
Multi-View MOOC Quality Evaluation via Information-Aware Graph Representation Learning
In this paper, we study the problem of MOOC quality evaluation which is ...
research
∙
10/08/2022
Finding and Exploring Promising Search Space for the 0-1 Multidimensional Knapsack Problem
The 0-1 multidimensional knapsack problem(MKP) is a classical NP-hard co...
research
∙
09/19/2020
Simplifying Reinforced Feature Selection via Restructured Choice Strategy of Single Agent
Feature selection aims to select a subset of features to optimize the pe...
research
∙
06/11/2020
Disentangled Non-Local Neural Networks
The non-local block is a popular module for strengthening the context mo...
research
∙
04/16/2019
On the Mathematical Understanding of ResNet with Feynman Path Integral
In this paper, we aim to understand Residual Network (ResNet) in a scien...
research
∙
03/14/2019
An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs
This paper proposes a novel branch-and-bound(BMWVC) algorithm to exactly...
research
∙
05/31/2017
Diversified Top-k Partial MaxSAT Solving
We introduce a diversified top-k partial MaxSAT problem, a combination o...
research
∙
02/15/2017
Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
The Minimum Weight Dominating Set (MWDS) problem is an important general...
research
∙
10/24/2014
Augmenting Ordered Binary Decision Diagrams with Conjunctive Decomposition
This paper augments OBDD with conjunctive decomposition to propose a gen...
research
∙
09/11/2013
Approximate Counting CSP Solutions Using Partition Function
We propose a new approximate method for counting the number of the solut...
research
∙
04/26/2011
Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems
In this paper, we investigate the hybrid tractability of binary Quantifi...
research
∙
04/05/2011
Phase Transitions in Knowledge Compilation: an Experimental Study
Phase transitions in many complex combinational problems have been widel...
research
∙
02/24/2011
New Worst-Case Upper Bound for X3SAT
The rigorous theoretical analyses of algorithms for exact 3-satisfiabili...
research
∙
02/24/2011
Worst-Case Upper Bound for (1, 2)-QSAT
The rigorous theoretical analysis of the algorithm for a subclass of QSA...
research
∙
02/24/2011
New Worst-Case Upper Bound for #XSAT
An algorithm running in O(1.1995n) is presented for counting models for ...
research
∙
02/24/2011
Counting Solutions of Constraint Satisfiability Problems:Exact Phase Transitions and Approximate Algorithm
The study of phase transition phenomenon of NP complete problems plays a...
research
∙
12/13/2010
Phase Transitions of Plan Modification in Conformant Planning
We explore phase transitions of plan modification, which mainly focus on...
research
∙
06/08/2010