A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
New checkable criteria for persistence of chemical reaction networks are proposed, which extend and complement existing ones. The new results allow the consideration of reaction ra...
David Angeli, Patrick De Leenheer, Eduardo D. Sont...
This paper presents a new approach to estimate “universal” phoneme posterior probabilities for mixed language speech recognition. More specifically, we propose a new theoreti...
Modern applications are becoming increasingly more dynamic and flexible. In Java software, one important flexibility mechanism is dynamic class loading. Unfortunately, the vast ...
In this paper we introduce a dynamic vehicle routing problem in which there are multiple vehicles and multiple priority classes of service demands. Service demands of each priority...
Stephen L. Smith, Marco Pavone, Francesco Bullo, E...