: Nowadays, the complexity of software applications has brought new challenges to developers, having to deal with a large number of computational requirements. Among these requirem...
Abstract. The aim of this paper is to show how the P systems with replicated rewriting can be modeled by X-machines (also called Eilenberg machines). In the first approach, the par...
Joaquin Aguado, Tudor Balanescu, Anthony J. Cowlin...
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
Abstract. The Time-Triggered Architecture, as architecture for safety-critical realtime applications, incorporates fault-tolerance mechanisms to ensure correct system operation des...
Wilfried Steiner, Michael Paulitsch, Hermann Kopet...
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...