Daoyun Xu

According to our database1, Daoyun Xu authored at least 35 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the upper bounds of (1,0)-super solutions for the regular balanced random (k,2s)-SAT problem.
Frontiers Comput. Sci., August, 2024

Exact satisfiability and phase transition analysis of the regular (k, d)-CNF formula.
Frontiers Comput. Sci., February, 2024

2022
Satisfiability threshold of the random regular (s, c, k)-SAT problem.
Frontiers Comput. Sci., 2022

2021
A Logarithmic Function-Based Novel Representation Algorithm for Image Classification.
Traitement du Signal, 2021

The Phase Transition Analysis for the Random Regular Exact 2-(d, k)-SAT Problem.
Symmetry, 2021

An algorithm for solving satisfiability problem based on the structural information of formulas.
Frontiers Comput. Sci., 2021

A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form.
Entropy, 2021

The Phase Transition Analysis for Random Regular Exact (s, c, k) - SAT Problem.
IEEE Access, 2021

2020
Weighted Image Averaging Based Anisotropic Diffusion Denoising Method for Ultrasound Thyroid Image.
J. Medical Imaging Health Informatics, 2020

Properties of the satisfiability threshold of the strictly d-regular random (3, 2s)-SAT problem.
Frontiers Comput. Sci., 2020

The Convergence of a Cooperation Markov Decision Process System.
Entropy, 2020

(1, 0)-Super Solutions of (k, s)-CNF Formula.
Entropy, 2020

Uniquely Satisfiable d-Regular (k, s)-SAT Instances.
Entropy, 2020

2018
用于求解正则(3, 4)-SAT实例集的修正警示传播算法 (Modified Warning Propagation Algorithm for Solving Regular (3, 4)-SAT Instance Sets).
计算机科学, 2018

Exploiting context for people detection in crowded scenes.
J. Electronic Imaging, 2018

2017
On-Line Load Balancing with Task Buffer.
Comput. Informatics, 2017

Degree Correlations in Two Layer Growth Model with Nonlinear Preferential Attachment Rule.
Proceedings of the Theoretical Computer Science - 35th National Conference, 2017

2016
正则3-SAT问题的相变现象 (Phase Transition Phenomenon of Regular 3-SAT Problem).
计算机科学, 2016

Background modeling methods in video analysis: A review and comparative evaluation.
CAAI Trans. Intell. Technol., 2016

2015
一种求解置换Flow Shop调度问题的DRPFSP算法 (DRPFSP Algorithm for Solving Permutation Flow Shop Scheduling Problem).
计算机科学, 2015

A heuristic algorithm for solving the problem of load balancing.
Proceedings of the Seventh International Conference on Advanced Computational Intelligence, 2015

2013
Piecewise Convex Technique for the Stability Analysis of Delayed Neural Network.
J. Appl. Math., 2013

Triple-integral method for the stability analysis of delayed neural networks.
Neurocomputing, 2013

Vector Wirtinger-type inequality and the stability analysis of delayed neural network.
Commun. Nonlinear Sci. Numer. Simul., 2013

Stable analysis for neural networks: Set-valued mapping method.
Appl. Math. Comput., 2013

2011
Modeling of Potential Customers Identification Based on Correlation Analysis and Decision Tree.
Proceedings of the Advances in Neural Networks - ISNN 2011, 2011

2009
Maximum Renamable Horn and Maximum Independent Sets.
Proceedings of the CSIE 2009, 2009 WRI World Congress on Computer Science and Information Engineering, March 31, 2009

2008
Hardness of Approximation Algorithms on k-SAT and (k, s)-SAT Problems.
Proceedings of the 9th International Conference for Young Computer Scientists, 2008

NP-Completeness of (k-SAT, r-UNk-SAT) and (LSAT>=k, r-UNLSAT>=k).
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2007
The Existence of Unsatisfiable Formulas in <i>k</i>-LCNF for <i>k</i>>=3.
Proceedings of the Theory and Applications of Models of Computation, 2007

2006
A New Lower Bound of Critical Function for (k, s)-SAT.
Proceedings of the Theory and Applications of Models of Computation, 2006

2005
Complexities of Homomorphism and Isomorphism for Definite Logic Programs.
J. Comput. Sci. Technol., 2005

The complexity of homomorphisms and renamings for minimal unsatisfiable formulas.
Ann. Math. Artif. Intell., 2005

2003
Characterization of an Auto-Compatible Default Theory.
J. Comput. Sci. Technol., 2003

2002
<i>FC</i>-normal and extended stratified logic program.
Sci. China Ser. F Inf. Sci., 2002


  Loading...