Guanfeng Wu

Orcid: 0000-0001-8449-974X

According to our database1, Guanfeng Wu authored at least 30 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Residual feature decomposition and multi-task learning-based variation-invariant face recognition.
Neural Comput. Appl., November, 2024

Multi-modal video search by examples - A video quality impact analysis.
IET Comput. Vis., October, 2024

Improving two-mode algorithm via probabilistic selection for solving satisfiability problem.
Inf. Sci., January, 2024

Multi Modal Fusion for Video Retrieval based on CLIP Guide Feature Alignment.
Proceedings of 2024 ACM ICMR Workshop on Multimodal Video Retrieval, 2024

MVRMLM 2024: Multimodal Video Retrieval and Multimodal Language Modelling.
Proceedings of the 2024 International Conference on Multimedia Retrieval, 2024

2023
Fully reusing clause deduction algorithm based on standard contradiction separation rule.
Inf. Sci., April, 2023

An efficient contradiction separation based automated deduction algorithm for enhancing reasoning capability.
Knowl. Based Syst., 2023

Formal Modelling of the Multiple Trains Following Operation in Uncertain Environments.
Proceedings of the 18th International Conference on Intelligent Systems and Knowledge Engineering, 2023

Designing Multimodal Video Search by Examples (MVSE) user interfaces: UX requirements elicitation and insights from semi-structured interviews.
Proceedings of the European Conference on Cognitive Ergonomics 2023, 2023

2022
Improving probability selection based weights for satisfiability problems.
Knowl. Based Syst., 2022

2021
Emphasis on the flipping variable: Towards effective local search for hard random satisfiability.
Inf. Sci., 2021

Improving stochastic local search for uniform k-SAT by generating appropriate initial assignment.
Comput. Intell., 2021

More efficient stochastic local search for satisfiability.
Appl. Intell., 2021

Improving CSE-F 1.0 Prover with Importance Measure Based Literal Selection Strategy.
Proceedings of the 16th International Conference on Intelligent Systems and Knowledge Engineering, 2021

Extending E Prover with Fully Use Binary Clauses Algorithm Based on Standard Contradiction Separation Rule.
Proceedings of the 16th International Conference on Intelligent Systems and Knowledge Engineering, 2021

2020
Improving probability selecting based weights for Satisfiability Problem.
CoRR, 2020

2019
A Contradiction Separation Dynamic Deduction Algorithm Based on Optimized Proof Search.
Int. J. Comput. Intell. Syst., 2019

A First-Order Logic Clause Set Preprocessing Method Based on Clause Deduction Distance.
Proceedings of the 14th IEEE International Conference on Intelligent Systems and Knowledge Engineering, 2019

2018
Set-Blocked Clause and Extended Set-Blocked Clause in First-Order Logic.
Symmetry, 2018

基于趋势强度的SAT问题学习子句评估算法 (Learnt Clause Evaluation Algorithm of SAT Problem Based on Trend Strength).
计算机科学, 2018

A Hybrid Learnt Clause Evaluation Algorithm for SAT Problem.
Int. J. Comput. Intell. Syst., 2018

An Improved Adaptive Genetic Algorithm for Solving 3-SAT Problems Based on Effective Restart and Greedy Strategy.
Int. J. Comput. Intell. Syst., 2018

2017
一种基于搜索路径识别的CDCL命题逻辑求解器延迟重启算法 (Path Identification Based Delaying Restart Algorithm for CDCL SAT Solver).
计算机科学, 2017

Multi-clause synergized contradiction separation based first-order theorem prover - MC-SCS.
Proceedings of the 12th International Conference on Intelligent Systems and Knowledge Engineering, 2017

An application security model based on business process in information system.
Proceedings of the 12th International Conference on Intelligent Systems and Knowledge Engineering, 2017

Parallel hybrid genetic algorithm for sat problems based on OpenMP.
Proceedings of the 12th International Conference on Intelligent Systems and Knowledge Engineering, 2017

An improved genetic algorithm for solving 3-SAT problems based on effective restart and greedy strategy.
Proceedings of the 12th International Conference on Intelligent Systems and Knowledge Engineering, 2017

Conflicting rate based branching heuristic for CDCL SAT solvers.
Proceedings of the 12th International Conference on Intelligent Systems and Knowledge Engineering, 2017

Adding a LBD-based rewarding mechanism in branching heuristic for SAT solvers.
Proceedings of the 12th International Conference on Intelligent Systems and Knowledge Engineering, 2017

Holistic deductive framework theorem proving based on standard contradiction separation for first-order logic.
Proceedings of the 12th International Conference on Intelligent Systems and Knowledge Engineering, 2017


  Loading...