Research map / Learning theory and algorithms / Combinatorial and search optimization
Aperiodic Tiling and Rhythmic Canons: A CP Journey
Guillaume Derval, Christophe Lecoutre
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace integer-domain model m1 with binary characteristic-vector model m2 using Lyndon-word lex constraints | CP model for ATCP · ATCP instance 2 (n=108) | solving time (s): 124.10 -> 1.98 | Improved |
| replace integer-domain model m1 with binary model m2 | CP model for ATCP · ATCP instance 5 (n=144) | solving time (s): 271.20 -> 1.90 | Improved |
| replace m2 with divide-and-conquer table model m3 | Model m2 · ATCP instance 18 (n=420, a=15) | solving time (s): 85.90 -> 60.33 | Improved |
| replace m2 with divide-and-conquer table model m3 | Model m2 · ATCP instance 32 (n=900, a=30) | solving time (s): 252.60 -> 111.20 | Improved |
| replace m2 with divide-and-conquer table model m3 | Model m2 · small ATCP instances | solving time (s) | No clear effect |
| add precomputed periodicity information to the tables (m4 over m3) (ablation) | Model m3 · ATCP instance 18 (n=420, a=15) | solving time (s): 60.33 -> 6.47 | Improved |
| add precomputed periodicity information to the tables (m4 over m3) (ablation) | Model m3 · ATCP instance 24 (n=420, a=6) | solving time (s): 27.23 -> 3.97 | Improved |
| add precomputed periodicity information to the tables (m4 over m3) (ablation) | Model m3 · ATCP instance 32 (n=900, a=30) | solving time (s): 111.20 -> 32.60 | Improved |
| add periodicity information to the tables (m4 over m3) (ablation) | Model m3 · ATCP instance 21 (n=420, a=14) | solving time (s): 8.82 -> 14.23 | Hurt |
| add periodicity information to the tables (m4 over m3) (ablation) | Model m3 · ATCP instance 22 (n=420, a=15) | solving time (s): 21.56 -> 114.91 | Hurt |
| add table decomposition to avoid direct linear tiling constraints; startup costs of two phases | Model m3 vs m2 · small ATCP instances | solving time (s) | Hurt |
Closest papers by meaning
- Unifying Symbolic Music Arrangement: Track-Aware Reconstruction and Structured Tokenization (NeurIPS 2025 · similarity 0.82)
- Structured Multi-Track Accompaniment Arrangement via Style Prior Modelling (NeurIPS 2024 · similarity 0.81)
- MuPT: A Generative Symbolic Music Pretrained Transformer (ICLR 2025 · similarity 0.81)
- Symbolic Music Generation with Non-Differentiable Rule Guided Diffusion (ICML 2024 · similarity 0.80)
- Exploiting Symmetries in MUS Computation (AAAI 2025 · similarity 0.79)
- ONLINE EPSILON NET & PIERCING SET FOR GEOMETRIC CONCEPTS (ICLR 2025 · similarity 0.79)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
