Zobrazeno 1 - 10
of 182
pro vyhledávání: '"Miguel, Ian"'
Local search is a common method for solving combinatorial optimisation problems. We focus on general-purpose local search solvers that accept as input a constraint model - a declarative description of a problem consisting of a set of decision variabl
Externí odkaz:
http://arxiv.org/abs/2410.05937
Constraint modelling languages such as Essence offer a means to describe combinatorial problems at a high-level, i.e., without committing to detailed modelling decisions for a particular solver or solving paradigm. Given a problem description written
Externí odkaz:
http://arxiv.org/abs/2409.15158
When solving decision and optimisation problems, many competing algorithms (model and solver choices) have complementary strengths. Typically, there is no single algorithm that works well for all instances of a problem. Automated algorithm selection
Externí odkaz:
http://arxiv.org/abs/2405.11059
It is well established that formulating an effective constraint model of a problem of interest is crucial to the efficiency with which it can subsequently be solved. Following from the observation that it is difficult, if not impossible, to know a pr
Externí odkaz:
http://arxiv.org/abs/2311.11868
Autor:
Espasa, Joan, Gent, Ian P., Miguel, Ian, Nightingale, Peter, Salamon, András Z., Villaret, Mateu
We report on progress in modelling and solving Puzznic, a video game requiring the player to plan sequences of moves to clear a grid by matching blocks. We focus here on levels with no moving blocks. We compare a planning approach and three constrain
Externí odkaz:
http://arxiv.org/abs/2310.01503
We study a planning problem based on Plotting, a tile-matching puzzle video game published by Taito in 1989. The objective of this game is to remove a target number of coloured blocks from a grid by sequentially shooting blocks into the grid. Plottin
Externí odkaz:
http://arxiv.org/abs/2310.01470
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 quality of the available problem instances. Modern constraint programming
Externí odkaz:
http://arxiv.org/abs/2205.14753
Autor:
Akgün, Özgür, Gent, Ian P., Jefferson, Christopher, Kiziltan, Zeynep, Miguel, Ian, Nightingale, Peter, Salamon, András Z., Ulrich-Oltean, Felix
The performance of a constraint model can often be improved by converting a subproblem into a single table constraint. In this paper we study heuristics for identifying promising candidate subproblems, where converting the candidate into a table cons
Externí odkaz:
http://arxiv.org/abs/2202.13250
Autor:
Akgün, Özgür, Frisch, Alan M., Gent, Ian P., Jefferson, Christopher, Miguel, Ian, Nightingale, Peter, Salamon, András Z.
The Essence language allows a user to specify a constraint problem at a level of abstraction above that at which constraint modelling decisions are made. Essence specifications are refined into constraint models using the Conjure automated modelling
Externí odkaz:
http://arxiv.org/abs/2111.00821
Plotting is a tile-matching puzzle video game published by Taito in 1989. Its objective is to reduce a given grid of coloured blocks down to a goal number or fewer. This is achieved by the avatar character repeatedly shooting the block it holds into
Externí odkaz:
http://arxiv.org/abs/2110.14397