Progressor: Personalized visual access to programming problems [PDF]
, 2011 This paper presents Progressor, a visualization of open student models intended to increase the student's motivation to progress on educational content. The system visualizes not only the user's own model, but also the peers' models.
Bakalov, F +3 more
core +1 more source
Modeling Stable Matching Problems with Answer Set Programming [PDF]
, 2013 The Stable Marriage Problem (SMP) is a well-known matching problem first introduced and solved by Gale and Shapley (1962). Several variants and extensions to this problem have since been investigated to cover a wider set of applications.
A. Kato +14 more
core +3 more sources
Integer programming methods for special college admissions problems [PDF]
, 2014 We develop Integer Programming (IP) solutions for some special college admission problems arising from the Hungarian higher education admission scheme. We focus on four special features, namely the solution concept of stable score-limits, the presence of
A Kwanashie +19 more
core +2 more sources
Learning to solve planning problems efficiently by means of genetic programming [PDF]
, 2001 Declarative problem solving, such as planning, poses interesting challenges for Genetic Programming (GP). There have been recent attempts to apply GP to planning that fit two approaches: (a) using GP to search in plan space or (b) to evolve a planner. In
Aler, Ricardo +2 more
core +5 more sources
Dynamic programming for graphs on surfaces [PDF]
, 2010 We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k.
B. Courcelle +15 more
core +1 more source
Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization [PDF]
, 2017 Interior point methods provide an attractive class of approaches for solving linear, quadratic and nonlinear programming problems, due to their excellent efficiency and wide applicability.
A Borzì +45 more
core +2 more sources
Solving stable matching problems using answer set programming [PDF]
, 2015 Since the introduction of the stable marriage problem (SMP) by Gale and Shapley (1962), several variants and extensions have been investigated. While this variety is useful to widen the application potential, each variant requires a new algorithm for ...
De Clercq, Sofie +3 more
core +2 more sources
Comparative Characteristics of Programming Languages for Solving Crossplatform Problems [PDF]
, 2017 The main purpose of cross-platform programming is to create software which will function correctly on different operation systems and hardware platforms.
Grishchenko, E. V. +2 more
core
Some recent results in the analysis of greedy algorithms for assignment problems [PDF]
, 1993 We survey some recent developments in the analysis of greedy algorithms for assignment and transportation problems. We focus on the linear programming model for matroids and linear assignment problems with Monge property, on general linear programs ...
Faigle, Ulrich
core +4 more sources
Direct lunar descent optimisation by finite elements in time approach [PDF]
, 1999 In this paper a direct approach to trajectory optimisation, based on Finite Elements in Time (FET) discretisation is presented. Trajectory optimisation is performed combining the effectiveness and flexibility of Finite Elements in Time in solving complex
Finzi, Amalia E., Vasile, Massimiliano
core