Shining a light on material appearance: Mapping NDFs to heightfields

This research proposes a new algorithm for mapping Normal Distribution Functions to Heightfields in order to answer its research question: ”Given an NDF, how can we generate a corresponding Heightfield using simple optimization algorithms?”. This research is important, as it helps us to gain a better understanding of how limited statistics-based...

Performance of the Pareto Envelope-Based Search Algorithm - II in Automated Test Case Generation

Software testing is an important yet time consuming task in the software development life cycle. Artificial Intelligence (AI) algorithms have been used to automate this task and have proven to be proficient at it. This research focuses on the automated testing of JavaScript programs, and builds upon the existing SynTest framework that is the...

Literature survey of type inference algorithms for statically typed languages

The success of dynamically typed languages such as Python has resulted in an increased interest in supporting type inference in statically typed lan- guages. Type inference refers to automatic type detection based on surrounding context and allows retaining the type safety (and other advantages) of static types, while matching the ease of use of...

Optimal decision trees for the Algorithm Selection Problem: A dynamic programming approach

The Algorithm Selection Problem is a relevant question in computer science that would enable us to predict which algorithm would perform better on a given instance of a problem. <br/>Different solutions have been proposed, either using Mixed Integer Programming or machine learning models, but both suffer from either poor scalability, no...

Individually fair optimal decision trees: Using a dynamic programming approach

In this paper, we tackle the problem of creating decision trees that are both optimal and individually fair. While decision trees are popular due to their interpretability, achieving optimality can be difficult. Existing approaches either lack scalability or fail to consider individual fairness. To address this, we define individual fairness as...

Optimal Regression Trees via Dynamic Programming: Optimization techniques for learning Regression Trees

Decision trees make decisions in a way interpretable to humans, this is important when machines are increasingly used to aid in making high-stakes and socially sensitive decisions. While heuristics have been used for a long time to find decision trees with reasonable accuracy, recent approaches find fully optimal trees. Due to the computational...

SAT-based optimisation for the resource-constrained project scheduling problem with time-dependent resource capacities and requests

In this paper, a variant of the resource-constrained project scheduling problem is discussed. This variant introduces time-dependence for resource capacities and requests, making the problem a more realistic model for many practical applications such as production scheduling and medical research project planning. The main aim of this paper is to...

Raytracing Mirror Anamorphosis

Mirror anamorphosis is characterised by a distorted projection, where the combination of a mirror and a specific viewpoint lets the observer see the undistorted image. The use of this technique and complex perspective in general has gone from being niche to becoming mainstream. Raytracing poses itself as a solution to solving the math for such...

Procedural automation of general game level generation: the good, the bad and the ugly

The monumental goal of Artificial Intelligence (AI) is to model general solutions that can be applied to perform a variety of tasks that normally demand human intelligence to solve. Traditionally human game developers painstakingly design and tweak levels until achieving the precise output of their heart’s desire. In the gaming industry, AI for...

A general analysis of change-point methods

The primary goal of this report is to provide a general overview of offline change-point literature as it is known today. Change-point methods are important statistical problems, where we are interested in determining whenever a certain data-set changes in structure. Furthermore, the term "off-line" is meant to indicate that the data itself is...