Theory and Applications of Models of Computation
16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings
Page
%P
175 Result(s)
within
Jian**n Chen
Computer Science
Algorithm Analysis and Problem Complexity
-
Article
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data
Based on well-known complexity theory conjectures, any polynomial-time kernelization algorithm for the NP-hard Line-Cover problem produces a kernel of size ...
-
Chapter and Conference Paper
D-IOCost: Dynamic Cost-Aware Fair Queueing for Better I/O Proportionality and Performance
As high-speed SSDs supporting multi-queue interfaces are widely used in shared storage systems, scheduling strategies should ensure fair sharing of device resources. However, when facing the workload of differ...
-
Article
A Refined Branching Algorithm for the Maximum Satisfiability Problem
The Maximum satisfiability problem (MaxSAT) is a fundamental NP-hard problem which has significant applications in many areas. Based on refined observations, we derive a branching algorithm of running time ...
-
Chapter and Conference Paper
Distributed Photovoltaic Grid-Connected Evaluation Method Based on Analytic Hierarchy Process and Radar Chart
The large-scale use of distributed photovoltaic brings challenges to the safe and reliable operation of power grid. Therefore, it is important to explore the impact of distributed photovoltaic on power grid. F...
-
Chapter and Conference Paper
Coordinated Setting Method of PSS and PSVR Parameters in Generator
Power system stabilizer (PSS) is widely used to damp power angle oscillation in power systems, and power system voltage regulator (PSVR) can improve the voltage characteristics. Both devices can be installed i...
-
Book and Conference Proceedings
-
Chapter and Conference Paper
Biomarkers Selection of Abnormal Functional Connections in Schizophrenia with \( {\mathbf{\ell }}_{{{\mathbf{2,1 - 2}}}} \) -Norm Based Sparse Regularization Feature Selection Method
Schizophrenia (SZ) is a serious mental disease involving multiple symptoms such as sensation, cognition, emotion and memory. Recent studies have shown that schizophrenia is related to abnormal functional conne...
-
Chapter and Conference Paper
A Reference Point-Based Evolutionary Algorithm for Many-Objective Fuzzy Portfolio Selection
Portfolio selection is an important problem in the practice and theory of finance. This paper uses a five-objective (including mean, variance, skewness, kurtosis, and entropy) model to replace the classical Ma...
-
Article
Preface to the Special Issue on Computing and Combinatorics
-
Chapter and Conference Paper
Approximating Closest Vector Problem in \(\ell _\infty \) Norm Revisited
The security of most lattice-based cryptography schemes are based on two computational hard problems which are the Short Integer Solution (SIS) and Learning With Errors (LWE) problems. The computational comple...
-
Chapter and Conference Paper
Graph-FCN for Image Semantic Segmentation
Semantic segmentation with deep learning has achieved great progress in classifying the pixels in the image. However, the local location information is usually ignored in the high-level feature extraction by t...
-
Chapter and Conference Paper
Threshold-Dependent Joint Bilateral Filter Algorithm for Enhancing 3D Gated Range-Intensity Correlation Imaging
Three-dimensional gated range-intensity correlation imaging (GRICI) can acquire three-dimensional information of targets with high range resolution in real time. In practical applications, the intensity distri...
-
Chapter and Conference Paper
Physarum-Based Ant Colony Optimization for Graph Coloring Problem
Graph coloring problem (GCP) is a classical combinatorial optimization problem and has many applications in the industry. Many algorithms have been proposed for solving GCP. However, insufficient efficiency an...
-
Chapter and Conference Paper
A Novel Many-Objective Optimization Algorithm Based on the Hybrid Angle-Encouragement Decomposition
For many-objective optimization problems (MaOPs), the problem of balancing the convergence and the diversity during the search process is often encountered but very challenging due to its vast range of searchi...
-
Book and Conference Proceedings
Frontiers in Algorithmics
12th International Workshop, FAW 2018, Guangzhou, China, May 8–10, 2018, Proceedings
-
Chapter and Conference Paper
An Improved Authentication Protocol in Telemedicine System
Telemedicine is an effective way to solve the imbalance in the distribution of medical resources. However, since related medical privacy data needs to be transmitted over the Internet, it will be exposed to th...
-
Chapter and Conference Paper
Solving Vehicle Routing Problem Through a Tabu Bee Colony-Based Genetic Algorithm
Vehicle routing problem (VRP) is a classic combinatorial optimization problem and has many applications in industry. Solutions of VRP have significant impact on logistic cost. In most VRP models, the shortest ...
-
Chapter and Conference Paper
Particle Swarm Optimization Based on Pairwise Comparisons
Particle swarm optimization (PSO) is a widely-adopted optimization algorithm which is based on particles’ fitness evaluations and their swarm intelligence. However, it is difficult to obtain the exact fitness ...
-
Chapter and Conference Paper
A Scalable Pthreads-Compatible Thread Model for VM-Intensive Programs
With the widespread adoption of multicore chips, many multithreaded applications based on the shared address space have been developed. Widely-used operating systems, such as Linux, use a per-process lock to s...
-
Chapter and Conference Paper
Approximation Algorithms on Multiple Two-Stage Flowshops
This paper considers the problem of scheduling multiple two-stage flowshops that minimizes the makespan, where the number of flowshops is part of the input. We study the relationship between the problem and th...
