We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Landing on distant planets is always a challenging task due to the distance and hostile environments found. In the design of autonomous hazard avoidance systems we find the particu...
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...