The length-based approach is a heuristic for solving randomly generated equations in groups which possess a reasonably behaved length function. We describe several improvements of ...
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...
The environments in which ambient agents are used often may be described by dynamical models, for example in the form of a set of differential equations. In this paper an ambient a...
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
Metaheuristic approaches to examination timetabling problems are usually split up into two phases: initialisation phase in which a heuristic is employed to construct an initial sol...