Automated generation of computationally hard feature models using evolutionary algorithms
A feature model is a compact representation of the products of a software product line. The
automated extraction of information from feature models is a thriving topic involving …
automated extraction of information from feature models is a thriving topic involving …
On the hardness of solving edge matching puzzles as SAT or CSP problems
Edge matching puzzles have been amongst us for a long time now and traditionally they
have been considered, both, a children's game and an interesting mathematical …
have been considered, both, a children's game and an interesting mathematical …
Structure-preserving instance generation
Real-world instances are critical for the development of state-of-the-art algorithms, algorithm
configuration techniques, and selection approaches. However, very few true industrial …
configuration techniques, and selection approaches. However, very few true industrial …
A guide-and-observe hyper-heuristic approach to the eternity ii puzzle
T Wauters, W Vancroonenburg… - Journal of Mathematical …, 2012 - Springer
The present paper considers the optimisation version of the Eternity II puzzle problem and
unsigned edge matching puzzles in general. The goal of this optimisation problem is to …
unsigned edge matching puzzles in general. The goal of this optimisation problem is to …
Efficient SAT-Based Approach for Solving Juosan Puzzles Muhammad Tsaqif Ammar, Muhammad Arzaki, and Gia Septiana Wulandari
MT Ammar - … : ICoMPAC 2023, Sukolilo, Indonesia, September 30, 2024 - books.google.com
Juosan is a single-player paper-and-pencil puzzle introduced in 2014 and shown to be NP-
complete in 2018. This NP-completeness implies that the Juosan puzzle is polynomial-time …
complete in 2018. This NP-completeness implies that the Juosan puzzle is polynomial-time …
Model-guided segmentation of 3D neuroradiological image using statistical surface wavelet model
This paper proposes a novel model-guided segmentation framework utilizing a statistical
surface wavelet model as a shape prior. In the model building process, a set of training …
surface wavelet model as a shape prior. In the model building process, a set of training …
Modeling Path Puzzles as SAT Problems and How to Solve Them Check for updates
JE Sakti, M Arzaki, GS Wulandari - Applied and Computational …, 2024 - books.google.com
This paper discusses a SAT-based approach for solving the Path Puzzles—one-player
paper-and-pencil puzzles recently proven NP-complete in 2020. The properties and rules of …
paper-and-pencil puzzles recently proven NP-complete in 2020. The properties and rules of …
Approximability of edge matching puzzles
A Antoniadis, A Lingas - SOFSEM 2010: Theory and Practice of Computer …, 2010 - Springer
This paper deals with the (in) approximability of Edge Matching Puzzles. The interest in
EdgeMatching Puzzles has been raised in the last few years with the release of the Eternity …
EdgeMatching Puzzles has been raised in the last few years with the release of the Eternity …
Efficient SAT-Based Approach for Solving Juosan Puzzles
MT Ammar, M Arzaki, GS Wulandari - International Conference on …, 2023 - Springer
Juosan is a single-player paper-and-pencil puzzle introduced in 2014 and shown to be NP-
complete in 2018. This NP-completeness implies that the Juosan puzzle is polynomial-time …
complete in 2018. This NP-completeness implies that the Juosan puzzle is polynomial-time …
Modeling Path Puzzles as SAT Problems and How to Solve Them
JE Sakti, M Arzaki, GS Wulandari - International Conference on …, 2023 - Springer
This paper discusses a SAT-based approach for solving the Path Puzzles—one-player
paper-and-pencil puzzles recently proven NP-complete in 2020. The properties and rules of …
paper-and-pencil puzzles recently proven NP-complete in 2020. The properties and rules of …