Given an arbitrary constraint c on n variables with domain size d, we show how to generate a custom propagator that establishes GAC in time O(nd) by precomputing the propagation th...
Ian P. Gent, Christopher Jefferson, Ian Miguel, Pe...
The construction of s-stage explicit two- and three-step peer methods of order p = 2s and p = 3s is considered for the solution of non-stiff second order initial value problems wh...
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Software components o er numerous advantages in terms of development, but may give rise to ine ciency due to highly generic implementations. Program specialization can automatical...
The problem of testing programs without test oracles is well known. A commonly used approach is to use special values in testing but this is often insufficient to ensure program c...