In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
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...
Abstract. We introduce a new approach for focusing constraint reasoning using so-called streamlining constraints. Such constraints partition the solution space to drive the search ...
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...