DoubleLex Revisited and Beyond
Authors: Xuming Huang, Jimmy Lee
IJCAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Our experiments confirm the theoretical predictions as well as efficiency of these methods. In this section, we compare the pruning powers and running time efficiencies of Double Lex, Swap Next, Swap Any and Double Lex+All Perm |
| Researcher Affiliation | Academia | Xuming Huang and Jimmy Lee Department of Computer Science and Engineering, The Chinese University of Hong Kong Shatin, N.T., Hong Kong {xmhuang,jlee}@cse.cuhk.edu.hk |
| Pseudocode | No | The paper defines constraints and discusses theoretical bounds and experimental results but does not include any pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not mention providing access to source code for its methodology. |
| Open Datasets | No | The paper evaluates on 'unconstrained m n matrices', 'Error correcting code Lee Distance (ECCLD)', and 'Balanced incomplete block designs (BIBD)', which are problem types, but does not provide specific access information (links, DOIs, repositories, or formal citations) for any datasets used in their experiments. |
| Dataset Splits | No | The paper focuses on constraint satisfaction problems and does not describe training, validation, or test dataset splits. |
| Hardware Specification | Yes | All experiments are conducted using Gecode 5.0.0 on Intel(R) Xeon(R) CPU E5-2630 v2 2.60GHz processor with 250G memory. |
| Software Dependencies | Yes | All experiments are conducted using Gecode 5.0.0 on Intel(R) Xeon(R) CPU E5-2630 v2 2.60GHz processor with 250G memory. |
| Experiment Setup | Yes | In the experiments, we use row-wise canonical ordering in lex constraints. Minimum domain size variable heuristic and minimum value heuristic are used unless otherwise specified. The time limit is one hour unless otherwise specified. We experiment with the rowwise variable heuristic and minimum value heuristic as it greatly outperforms the default heuristic we used in finding all solutions. |