We develop an efficient incremental version of an existing cost-based filtering algorithm for the knapsack constraint. On a universe of n elements, m invocations of the algorith...
Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal ...
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
We study the slow singular limit for planar anharmonic oscillatory motion of a charged particle under the influence of a perpendicular magnetic field when the mass of the particl...
— First order linear time invariant and time delayed dynamics of neutral type is taken into account with three rationally independent delays. There are two main contributions of ...
Quantitative properties of timed regular languages, such as information content (growth rate, entropy) are explored. The approach suggested by the same authors is extended to lang...