Now showing items 1-2 of 2

  • 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 ...
  • Orthogonal persistence revisited 

    Dearle, Alan; Kirby, Graham; Morrison, Ron (Springer-Verlag, 2009-07-01) - Conference item
    The social and economic importance of large bodies of programs and data that are potentially long-lived has attracted much attention in the commercial and research communities. Here we concentrate on a set of methodologies ...