Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Salamon, András Z."'
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
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:
Salamon, András Z., Wehar, Michael
A classic result of Paul, Pippenger, Szemer\'edi and Trotter states that DTIME(n) is strictly contained in NTIME(n). The natural question then arises: could DTIME(t(n)) be contained in NTIME(n) for some superlinear time-constructible function t(n)? I
Externí odkaz:
http://arxiv.org/abs/2111.02138
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
Autor:
Akgün, Özgür, Dang, Nguyen, Espasa, Joan, Miguel, Ian, Salamon, András Z., Stone, Christopher
Publikováno v:
ModRef 2020 - The 19th workshop on Constraint Modelling and Reformulation
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. Constraint programming and automated planning are examples of these areas, wh
Externí odkaz:
http://arxiv.org/abs/2009.10156
Autor:
Salamon, András Z., Wehar, Michael
We introduce techniques for proving superlinear conditional lower bounds for polynomial time problems. In particular, we show that CircuitSAT for circuits with m gates and log(m) inputs (denoted by log-CircuitSAT) is not decidable in essentially-line
Externí odkaz:
http://arxiv.org/abs/2008.06805
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Salamon, András Z.1 (AUTHOR) Andras.Salamon@st-andrews.ac.uk, Wehar, Michael2 (AUTHOR)
Publikováno v:
Theory of Computing Systems. Jun2023, Vol. 67 Issue 3, p548-568. 21p.
