W
Wenqi Huang
Researcher at Sun Yat-sen University
Publications - 121
Citations - 3038
Wenqi Huang is an academic researcher from Sun Yat-sen University. The author has contributed to research in topics: Medicine & Internal medicine. The author has an hindex of 27, co-authored 95 publications receiving 2501 citations. Previous affiliations of Wenqi Huang include Huazhong University of Science and Technology & Guizhou University.
Papers
More filters
Book ChapterDOI
Diversification and determinism in local search for satisfiability
Chu Min Li,Wenqi Huang +1 more
TL;DR: This paper proposes a diversification parameter for Novelty (or R-Novelty) heuristic to break the determinism in Novelty and shows its performance compared with the random walk parameter in novels and exploits promising decreasing paths in a deterministic fashion in local search using a gradient-based approach.
Journal ArticleDOI
An improved algorithm for the packing of unequal circles within a larger containing circle
TL;DR: An approved algorithm for the problems of unequal circle packing – the quasi-physical quasi-human algorithm that can be thought as an adoptive algorithm of the Tabu search is described.
Discrete Optimization An improved algorithm for the packing of unequal circles within a larger containing circle
TL;DR: The quasi-physical quasihuman algorithm (QPQA) as mentioned in this paper is a quasi-human approach to solve the problem of unequal circle packing, which is an analogy to the physical model in which a number of smooth cylinders are packed inside a container.
Journal ArticleDOI
An effective quasi-human based heuristic for solving the rectangle packing problem
TL;DR: An effective deterministic heuristic, Less Flexibility First, is introduced for solving the classical NP-complete rectangle packing problem, and can consistently produce packing densities of around 99% on most randomly generated large examples.
Journal ArticleDOI
Greedy algorithms for packing unequal circles into a rectangular container
TL;DR: This paper proposes two greedy algorithms for packing unequal circles into a two-dimensional rectangular container that selects the next circle to place according to the maximum-hole degree rule, inspired from human activity in packing.