Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHuimin Fu 0002
Person information
- affiliation: Southwest Jiaotong University, National-Local Joint Engineering Laboratory of System Credibility Automatic Verification, Chengdu, Sichuan, China
- unicode name: 付慧敏
Other persons with the same name
- Huimin Fu 0001 — Beihang University, Beijing, China
- Huimin Fu 0003 — Southwest Jiaotong University, School of Mathematics, Chengdu, Sichuan, China
- Huimin Fu 0004 — Hefei University of Technology, School of Management, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Huimin Fu
, Shaowei Cai, Guanfeng Wu, Jun Liu, Xin Yang, Yang Xu:
Improving two-mode algorithm via probabilistic selection for solving satisfiability problem. Inf. Sci. 653: 119751 (2024)- 2022
- [j8]Huimin Fu, Jun Liu, Guanfeng Wu, Yang Xu, Geoff Sutcliffe:
Improving probability selection based weights for satisfiability problems. Knowl. Based Syst. 245: 108572 (2022) - 2021
- [j7]Huimin Fu, Guanfeng Wu, Jun Liu, Yang Xu:
More efficient stochastic local search for satisfiability. Appl. Intell. 51(6): 3996-4015 (2021) - [j6]Huimin Fu, Wuyang Zhang, Guanfeng Wu, Yang Xu, Jun Liu:
Improving stochastic local search for uniform k-SAT by generating appropriate initial assignment. Comput. Intell. 37(4): 1706-1744 (2021) - [j5]Huimin Fu, Yang Xu, Guanfeng Wu, Jun Liu, Shuwei Chen, Xingxing He:
Emphasis on the flipping variable: Towards effective local search for hard random satisfiability. Inf. Sci. 566: 118-139 (2021) - 2020
- [j4]Huimin Fu, Jun Liu, Yang Xu:
Focused random walk with probability distribution for SAT with long clauses. Appl. Intell. 50(12): 4732-4753 (2020) - [j3]Huimin Fu, Yang Xu, Shuwei Chen, Jun Liu:
Improving WalkSAT for Random 3-SAT Problems. J. Univers. Comput. Sci. 26(2): 220-243 (2020) - [i1]Huimin Fu, Yang Xu, Jun Liu, Guanfeng Wu, Geoff Sutcliffe:
Improving probability selecting based weights for Satisfiability Problem. CoRR abs/2007.15185 (2020)
2010 – 2019
- 2018
- [j2]Huimin Fu, Yang Xu, Guanfeng Wu, Hairui Jia, Wuyang Zhang, Rong Hu:
An Improved Adaptive Genetic Algorithm for Solving 3-SAT Problems Based on Effective Restart and Greedy Strategy. Int. J. Comput. Intell. Syst. 11(1): 402-413 (2018) - [j1]Xinran Ning, Yang Xu, Guanfeng Wu, Huimin Fu:
Set-Blocked Clause and Extended Set-Blocked Clause in First-Order Logic. Symmetry 10(11): 553 (2018) - 2017
- [c1]Huimin Fu, Yang Xu, Guanfeng Wu, Xinran Ning:
An improved genetic algorithm for solving 3-SAT problems based on effective restart and greedy strategy. ISKE 2017: 1-6
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
