Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Patrick Spracklen"'
Funding: This work is supported by the EPSRC grants EP/P015638/1 and EP/P026842/1, and Nguyen Dang is a Leverhulme Early Career Fellow. The authors used the Cirrus UK National Tier-2 HPC Service at EPCC (http://www.cirrus.ac.uk) funded by the Univers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf9a5f782f175f2efec93f3b800dcdc1
https://hdl.handle.net/10023/27357
https://hdl.handle.net/10023/27357
Autor:
Peter Nightingale, Ian Miguel, Özgür Akgün, Patrick Spracklen, Ian P. Gent, Christopher Jefferson
Publikováno v:
Artificial Intelligence. 251:35-61
Authors thank the EPSRC for funding this work through grants EP/H004092/1, EP/K015745/1, EP/M003728/1, and EP/P015638/1. In addition, Dr Jefferson is funded by a Royal Society University Research Fellowship. When solving a combinatorial problem using
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3541c5301b7f8c02b9d6150098569cc9
https://doi.org/10.1016/j.artint.2017.07.001
https://doi.org/10.1016/j.artint.2017.07.001
Autor:
Christopher Stone, Nguyen Dang, Patrick Spracklen, András Z. Salamon, Özgür Akgün, Ian Miguel
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030589417
CPAIOR
CPAIOR
This work is supported by EPSRC grant EP/P015638/1 and used the Cirrus UK National Tier-2 HPC Service at EPCC funded by the University of Edinburgh and EPSRC (EP/P020267/1). We extend automatic instance generation methods to allow cross-paradigm comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f66d46a3e5f451faf435272684f6065b
https://doi.org/10.1007/978-3-030-58942-4_3
https://doi.org/10.1007/978-3-030-58942-4_3
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030300470
CP
CP
Funding: UK EPSRC grant EP/P015638/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 of streamliner constraints, whi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04e7283dfd965bfc55b6121ff8381c47
https://doi.org/10.1007/978-3-030-30048-7_22
https://doi.org/10.1007/978-3-030-30048-7_22
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319983332
CP
CP
Funding: EPSRC EP/P015638/1. Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to reduce the search space, while retaining at least one solution. Previously it has been established that it is possible to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8b2d274ffbbad056ae8ac01adf2723c
https://hdl.handle.net/10023/15894
https://hdl.handle.net/10023/15894
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319232188
CP
CP
The formulation of a Propositional Satisfiability (SAT) problem instance is vital to efficient solving. This has motivated research on preprocessing, and inprocessing techniques where reformulation of a SAT instance is interleaved with solving. Prepr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f31f04bce983c0db8af05425875d5293
http://booleconferences.ucc.ie/cp2015
http://booleconferences.ucc.ie/cp2015
Publikováno v:
University of St Andrews CRIS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6feb03fb00734dc78d06fb4bd94ad546
https://risweb.st-andrews.ac.uk/portal/en/researchoutput/towards-portfolios-of-streamlined-constraint-models(d868096c-9b0a-428f-83a1-d508f98736a5).html
https://risweb.st-andrews.ac.uk/portal/en/researchoutput/towards-portfolios-of-streamlined-constraint-models(d868096c-9b0a-428f-83a1-d508f98736a5).html