We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L do...
This paper builds a new theoretical connection between singular control of finite variation and optimal switching problems. This correspondence provides a novel method for solving ...
The Traverso-Swan theorem says that a reduced ring A is seminormal if and only if the natural homomorphism Pic A Pic A[X] is an isomorphism ([18, 17]). We give here all the detai...
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserve...