Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

S. K. Cheung

dblp:41/830 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2Artificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Mathematical optimization · 87% Computational geometry · 13%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
combinatorial optimization
0.021997
Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case · IEEE Trans. Computers 1997
Optimal Placements of Flexible Objects: Part I: Analytical Results for the Unbounded Case · IEEE Trans. Computers 1997
Mathematical optimization › combinatorial optimization
optimal placement
0.021997
Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case · IEEE Trans. Computers 1997
Optimal Placements of Flexible Objects: Part I: Analytical Results for the Unbounded Case · IEEE Trans. Computers 1997
Mathematical optimization
metaheuristic optimization
0.011997
Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case · IEEE Trans. Computers 1997
Mathematical optimization › metaheuristic optimization
simulated annealing
0.011997
Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case · IEEE Trans. Computers 1997
Computational geometry › packing and covering
packing and layout
0.021997
Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case · IEEE Trans. Computers 1997
Optimal Placements of Flexible Objects: Part I: Analytical Results for the Unbounded Case · IEEE Trans. Computers 1997
Computational geometry
periodic structures
0.011997
Optimal Placements of Flexible Objects: Part I: Analytical Results for the Unbounded Case · IEEE Trans. Computers 1997

Methods — techniques the papers use, named apart from their topics

simulated annealing · 0.0physical deformation model · 0.0hexagonal/square/triangular arrangement analysis · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
1998 Optimal Placements of Flexible Objects: An Adaptive Simulated Annealing Approach
S. K. Cheung, Kwong-Sak Leung, Andreas Alexander Albrecht, Chak-Kuen Wong
PPSN1
1997 Optimal Placements of Flexible Objects: Part I: Analytical Results for the Unbounded Case
abstract
The authors consider optimal placements of two-dimensional flexible (elastic, deformable) objects. The objects are discs of equal size placed within a rigid boundary. The paper is divided into two parts. In the first part, analytical results for three types of regular, periodic arrangements-the hexagonal, square, and triangular placements-are presented. The regular arrangements are analyzed for rectangular boundaries and radii of discs that are small compared to the area of the placement region, because, in this case, the influence of boundary conditions can be neglected. This situation is called the unbounded case. They show that, for the unbounded case among the three regular placements, the type of hexagonal arrangements provides the largest number of placed units for the same deformation depth. Furthermore, it can be proved that these regular placements are not too far from the truly optimal arrangements. For example, hexagonal placements differ at most by the factor of 1.1 from the largest possible number of generally shaped units in arbitrary arrangements. These analytical results are used as guidances for testing stochastic algorithms optimizing placements of flexible objects. In the second part, mainly two problems are considered: the underlying physical model and a simulated annealing algorithm maximizing the number of flexible discs in equilibrium placements. Along with the physical model, an approximate formula is derived, reflecting the deformation/force relationship for a large range of deformations.
Andreas Alexander Albrecht, S. K. Cheung, Kwong-Sak Leung, Chak-Kuen Wong
IEEE Trans. Computers2
1997 Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case
abstract
For pt.I see ibid., p.890-904. The paper is a continuation of the first part, where the authors considered regular arrangements of flexible objects for the unbounded case. The present part deals with a simulated annealing algorithm maximizing the number of flexible objects in equilibrium placements within rigid boundaries. The forces caused by the boundary are taken into account, i.e., the bounded case of placements is considered. The simulated annealing procedure makes use of the special structure of the underlying configuration space and relationships between deformations of flexible objects and resulting forces. This allows one to obtain tight bounds for the annealing parameters which result in n/sup 3/2//spl middot/In/sup 5/2/ and n/spl middot/In/sup 2/n time bounds, respectively, for the computation of equilibrium states by two different cooling schedules. The deformation/force formula is derived from a physical model of flexible discs and is based on numerical experiments which were performed for different materials and different sizes of objects. The algorithm was first implemented and tested for the unbounded case. The run-time is relatively short, even for large numbers of placed discs. These results are compared to the analytical ones obtained for regular placements in the first part of the paper, and agreement between these two sets of results are observed. Furthermore, several experiments for placements with boundary conditions were carried out and the resulting placements clearly show the effect of the forces from the rigid boundary.
Andreas Alexander Albrecht, S. K. Cheung, Kwong-Sak Leung, Chak-Kuen Wong
IEEE Trans. Computers2