Now showing items 1-12 of 12

    • Automated static symmetry breaking in constraint satisfaction problems 

      Grayland, Andrews (University of St Andrews, 2011) - Thesis
      Variable symmetries in constraint satisfaction problems can be broken by adding lexicographic ordering constraints. Existing general methods of generating such sets of ordering constraints can produce a huge number of ...
    • Automatically generating streamlined constraint models with ESSENCE and CONJURE 

      Wetter, James; Akgun, Ozgur; Miguel, Ian (Springer, 2015-08-13) - Conference item
      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, effective streamlined models have been constructed ...
    • Automatically improving constraint models in Savile Row 

      Nightingale, Peter; Akgün, Özgür; Gent, Ian P.; Jefferson, Christopher; Miguel, Ian; Spracklen, Patrick (2017-10) - Journal article
      When solving a combinatorial problem using Constraint Programming (CP) or Satisfiability (SAT), modelling and formulation are vital and difficult tasks. Even an expert human may explore many alternatives in modelling a ...
    • Automatically improving constraint models in Savile Row through associative-commutative common subexpression elimination 

      Nightingale, Peter; Akgun, Ozgur; Gent, Ian P.; Jefferson, Christopher; Miguel, Ian (Springer, 2014-09-08) - Conference item
      When solving a problem using constraint programming, constraint modelling is widely acknowledged as an important and difficult task. Even a constraint modelling expert may explore many models and spend considerable time ...
    • Breaking conditional symmetry in automated constraint modelling with CONJURE 

      Akgün, Özgür; Gent, Ian; Jefferson, Chris; Miguel, Ian; Nightingale, Peter (IOS Press, 2014) - Book item
      Many constraint problems contain symmetry, which can lead to redundant search. If a partial assignment is shown to be invalid, we are wasting time if we ever consider a symmetric equivalent of it. A particularly important ...
    • Cloud benchmarking for performance 

      Varghese, Blesson; Akgun, Ozgur; Miguel, Ian; Thai, Long; Barker, Adam (IEEE, 2014-12-15) - Conference item
      How can applications be deployed on the cloud to achieve maximum performance? This question has become significant and challenging with the availability of a wide variety of Virtual Machines (VMs) with different performance ...
    • Effective compilation of constraint models 

      Rendl, Andrea (University of St Andrews, 2010) - Thesis
      Constraint Programming is a powerful technique for solving large-scale combinatorial (optimisation) problems. However, it is often inaccessible to users without expert knowledge in the area, precluding the wide-spread ...
    • Extensible automated constraint modelling via refinement of abstract problem specifications 

      Akgün, Özgür (University of St Andrews, 2014-06-25) - Thesis
      Constraint Programming (CP) is a powerful technique for solving large-scale combinatorial (optimisation) problems. Constraint solving a given problem proceeds in two phases: modelling and solving. Effective modelling has ...
    • Model selection and testing for an automated constraint modelling toolchain 

      Hussain, Bilal Syed (University of St Andrews, 2017-06-21) - Thesis
      Constraint Programming (CP) is a powerful technique for solving a variety of combinatorial problems. Automated modelling using a refinement based approach abstracts over modelling decisions in CP by allowing users to specify ...
    • Modelling Langford's Problem : a viewpoint for search 

      Akgün, Özgür; Miguel, Ian (2018-08-27) - Conference item
      The performance of enumerating all solutions to an instance of Langford's Problem is sensitive to the model and the search strategy. In this paper we compare the performance of a large variety of models, all derived from ...
    • On algorithm selection, with an application to combinatorial search problems 

      Kotthoff, Lars (University of St Andrews, 2012-06-20) - Thesis
      The Algorithm Selection Problem is to select the most appropriate way for solving a problem given a choice of different ways. Some of the most prominent and successful applications come from Artificial Intelligence and in ...
    • Optimal deployment of geographically distributed workflow engines on the Cloud 

      Thai, Long; Barker, Adam; Varghese, Blesson; Akgun, Ozgur; Miguel, Ian (IEEE, 2014-10-30) - Conference item
      When orchestrating Web service workflows, the geographical placement of the orchestration engine(s) can greatly affect workflow performance. Data may have to be transferred across long geographical distances, which in turn ...