Solving Multi-Configuration Problems: A Performance Analysis with Choco Solver

• URL: http://arxiv.org/abs/2310.02658v2
• Date: Thu, 19 Oct 2023 12:51:53 GMT
• Title: Solving Multi-Configuration Problems: A Performance Analysis with Choco Solver
• Authors: Benjamin Ritz, Alexander Felfernig, Viet-Man Le, Sebastian Lubos
• Abstract summary: In this paper, we exemplify the application of multi-configuration for generating individualized exams. We also provide a constraint solver performance analysis which helps to gain some insights into corresponding performance issues.
• Score: 49.712444772173775
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In many scenarios, configurators support the configuration of a solution that satisfies the preferences of a single user. The concept of \emph{multi-configuration} is based on the idea of configuring a set of configurations. Such a functionality is relevant in scenarios such as the configuration of personalized exams, the configuration of project teams, and the configuration of different trips for individual members of a tourist group (e.g., when visiting a specific city). In this paper, we exemplify the application of multi-configuration for generating individualized exams. We also provide a constraint solver performance analysis which helps to gain some insights into corresponding performance issues.

Related papers

• Dominating Set Reconfiguration with Answer Set Programming [0.5242869847419832]
  We develop an approach to solve the dominating set reconfiguration problem based on Answer Set Programming (ASP) Our approach relies on a high-level ASP encoding, and both the grounding and solving tasks are delegated to an ASP-based solver.
  arXiv  Detail & Related papers  (2024-08-14T12:38:12Z)
• Generating Maximal Configurations and Their Variants Using Code Metrics [0.0]
  We present new configuration-generation algorithms that leverage constraint solving (SAT and MaxSAT) and configuration fuzzing. We show that our MaxSAT-based configuration generation achieves better coverage for several code metrics. Results also show that, when high coverage of multiple configurations is needed, CONFIZZ's presence-condition fuzzing outperforms alternatives.
  arXiv  Detail & Related papers  (2024-01-15T18:58:22Z)
• Automatic MILP Solver Configuration By Learning Problem Similarities [1.1585113506994469]
  Mixed Linear Programs (MILP) solvers expose numerous configuration parameters to control their internal algorithms. We aim to predict configuration parameters for unseen problem instances that yield lower-cost solutions without the time overhead of searching-and-evaluating configurations. We show that instances that have similar costs using one solver configuration also have similar costs using another solver configuration in the same runtime environment.
  arXiv  Detail & Related papers  (2023-07-02T21:31:47Z)
• Conjunctive Query Based Constraint Solving For Feature Model Configuration [79.14348940034351]
  We show how to apply conjunctive queries to solve constraint satisfaction problems. This approach allows the application of a wide-spread database technology to solve configuration tasks.
  arXiv  Detail & Related papers  (2023-04-26T10:08:07Z)
• Optimal Event Monitoring through Internet Mashup over Multivariate Time Series [77.34726150561087]
  This framework supports the services of model definitions, querying, parameter learning, model evaluations, data monitoring, decision recommendations, and web portals. We further extend the MTSA data model and query language to support this class of problems for the services of learning, monitoring, and recommendation.
  arXiv  Detail & Related papers  (2022-10-18T16:56:17Z)
• Configuring Multiple Instances with Multi-Configuration [48.98522706358725]
  We introduce a new configuration approach - multi-configuration - that focuses on scenarios where the outcome of a configuration process is a set of configurations. Example applications thereof are the configuration of personalized exams for individual students, the configuration of project teams, reviewer-to-paper assignment, and hotel room assignments. For multi-configuration scenarios, we exemplify a constraint satisfaction problem representation in the context of configuring exams.
  arXiv  Detail & Related papers  (2021-09-20T17:04:56Z)
• An Efficient Diagnosis Algorithm for Inconsistent Constraint Sets [68.8204255655161]
  We introduce a divide-and-conquer based diagnosis algorithm (FastDiag) which identifies minimal sets of faulty constraints in an over-constrained problem. We compare FastDiag with the conflict-directed calculation of hitting sets and present an in-depth performance analysis.
  arXiv  Detail & Related papers  (2021-02-17T19:55:42Z)
• An Overview of Recommender Systems and Machine Learning in Feature Modeling and Configuration [55.67505546330206]
  We give an overview of a potential new line of research which is related to the application of recommender systems and machine learning techniques. In this paper, we give examples of the application of recommender systems and machine learning and discuss future research issues.
  arXiv  Detail & Related papers  (2021-02-12T17:21:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.