Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
Machine scheduling is a critical problem in industries where products are custom-designed. The wide range of products, the lack of previous experiences in manufacturing, and the s...
Juan Carlos Vidal, Manuel Mucientes, Alberto Bugar...
There has been a dramatic increase in interactive cloud based software applications. Compared to classical realtime media applications (voice over IP (VoIP)/conferencing) and non r...
Sanjeev Mehrotra, Jin Li, Sudipta Sengupta, Manish...
Numerous formalisms and dedicated algorithms have been designed in the last decades to model and solve decision making problems. Some formalisms, such as constraint networks, can ...
Abstract. We propose a novel hybrid planning approach for the automated generation of IT change plans. The algorithm addresses an abstraction mismatch between refinement of tasks ...
Sebastian Hagen, Nigel Edwards, Lawrence Wilcock, ...