-
Article
DSLS: a simple and efficient local search algorithm for the maximum bisection problem
The maximum bisection problem (max-bisection) belongs to a family of well-known graph partitioning problems with wide applications. In this study, we develop a simple and efficient local search algorithm calle...
-
Article
Recognize after early fusion: the Chinese food recognition based on the alignment of image and ingredients
As concerns about health continue to grow, more and more works are being done in the field of food computing. One of the basic topics in food computing is how to extract important information from food and ana...
-
Article
DeciLS-PBO: an effective local search method for pseudo-Boolean optimization
-
Article
DPAHMA: a novel dual-population adaptive hybrid memetic algorithm for non-slicing VLSI floorplans
Floorplanning is a crucial part of very large-scale integration (VLSI) physical design flow. It primarily determines the position of the blocks on a chip by considering the area, the total wirelength, etc., in...
-
Article
DiagDO: an efficient model based diagnosis approach with multiple observations
Model-based diagnosis (MBD) with multiple observations shows its significance in identifying fault location. The existing approaches for MBD with multiple observations use observations which is inconsistent wi...
-
Article
An efficient power set map** space blocking algorithm for sensor selection in uncertain systems with quantified diagnosability requirements
For uncertain systems, the impacts of model uncertainties and measurement noise are considered during the modeling process. The distinguishability that is derived from the Kullback-Leibler divergence quantifie...
-
Article
Lightweight axiom pinpointing via replicated driver and customized SAT-solving
In description logic, axiom pinpointing is used to explore defects in ontologies and identify hidden justifications for a logical consequence. In recent years, SAT-based axiom pinpointing techniques, which rel...
-
Article
Evolutionary many-objective satisfiability solver for configuring software product lines
Software product line configuration (SPLC) is a typical many-objective optimization problem. Its purpose is to optimize multiple objectives simultaneously in a highly constrained space for searching. Recently,...
-
Article
Model-based diagnosis with improved implicit hitting set dualization
Model-based Diagnosis (MBD) with multiple observations is a currently complicated problem with many applications and solving this problem is attracting more and more attention. This paper propose an improved a...
-
Article
An efficient and effective approach for multi-fact extraction from text corpus
Relation extraction (RE) is a fundamental task with various real-world applications. Although significant progress has been achieved in this research field, it is still limited to single-fact extraction. In pr...
-
Article
Core-guided method for constraint-based multi-objective combinatorial optimization
Multi-Objective Combinatorial Optimization(MOCO), which consists of several conflicting objectives to be optimized, finds an ever-increasing number of uses in many real-world applications. In past years, the r...
-
Article
Exploring duality on ontology debugging
Ontology debugging is an important and intractable reasoning task. Minimal unsatisfiability-preserving subset (MUPS) which is a minimal subset of an ontology to debug an unsatisfiable concept, is an important ...
-
Article
Extracting a justification for OWL ontologies by critical axioms
Extracting justifications for web ontology language (OWL) ontologies is an important mission in ontology engineering. In this paper, we focus on black-box techniques which are based on ontology reasoners. Thro...
-
Article
Business Process Modeling Abstraction Based on Semi-Supervised Clustering Analysis
The most prominent Business Process Model Abstraction (BPMA) use case is the construction of the process “quick view” for rapidly comprehending a complex process. Some researchers propose process abstraction m...
-
Article
Revised simplex algorithm for linear programming on GPUs with CUDA
The revised simplex algorithm (RSA) is a typical algorithm for solving linear programming problems. Many theoretical modifications have been done to make the algorithm more efficient, but almost all of them we...
-
Article
A novel approach for improving quality of health state with difference degree in circuit diagnosis
Model-based diagnosis (MBD) has been widely acknowledged to be an effective fault diagnosis paradigm for combinational circuits. Most diagnosis algorithms (DAs) return a single diagnosis, a list of diagnoses o...
-
Article
Efficient zonal diagnosis with maximum satisfiability
Model-based diagnosis (MBD) has been widely acknowledged as an effective diagnosis paradigm. However, for large scale circuits, it is difficult to find all cardinality-minimal diagnoses within a reasonable tim...
-
Article
A restart local search algorithm for solving maximum set k-covering problem
The maximum set k-covering problem (MKCP) is a famous combinatorial optimization problem with widely many practical applications. In our work, we design a restart local search algorithm for solving MKCP, which is...
-
Article
Computing all minimal hitting sets by subset recombination
In model-based diagnosis from first principles, the efficient computation of all minimal hitting sets (MHS) as candidates for the conflict component sets of a device is a vital task. However, deriving all MHS ...
-
Chapter and Conference Paper
Landmark-Biased Random Walk for Deterministic Planning
Monte-Carlo random walk is a new wave of forward chaining search planning methods, which adopt more explorative search algorithms to handle heuristic deficiencies. During planning, random walks are used to exp...
