This paper shows how action theories, expressed in an extended version of the language B, can be naturally encoded using Prioritized Default Theory. We also show how prioritized d...
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can in...
Given linear matrix inequalities (LMIs) L1 and L2 in the same number of variables it is natural to ask: (Q1) does one dominate the other, that is, does L1(X) 0 imply L2(X) 0? (Q2) ...
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...