4 citations · 5 across the 5 of their papers we have counts for
6 papers
A portfolio-based analysis method for competition results
Nguyen Dang
Competitions such as the MiniZinc Challenges or the SAT competitions have been very useful sources for comparing performance of different solving approaches and for advancing the s…
A Framework for Generating Informative Benchmark Instances
Nguyen Dang, Özgür Akgün, Joan Espasa +2
Benchmarking is an important tool for assessing the relative performance of alternative solving approaches. However, the utility of benchmarking is limited by the quantity and qual…
Theory-inspired Parameter Control Benchmarks for Dynamic Algorithm Configuration
André Biedenkapp, Nguyen Dang, Martin S. Krejca +2
It has long been observed that the performance of evolutionary algorithms and other randomized search heuristics can benefit from a non-static choice of the parameters that steer t…
Efficient Incremental Modelling and Solving
Gökberk Koçak, Özgür Akgün, Nguyen Dang +1
In various scenarios, a single phase of modelling and solving is either not sufficient or not feasible to solve the problem at hand. A standard approach to solving AI planning prob…
Exploring Instance Generation for Automated Planning
Özgür Akgün, Nguyen Dang, Joan Espasa +3
Many of the core disciplines of artificial intelligence have sets of standard benchmark problems well known and widely used by the community when developing new algorithms. Constra…
Towards Portfolios of Streamlined Constraint Models: A Case Study with the Balanced Academic Curriculum Problem
Patrick Spracklen, Nguyen Dang, Özgür Akgün +1
Augmenting a base constraint model with additional constraints can strengthen the inferences made by a solver and therefore reduce search effort. We focus on the automatic addition…