The combination of demand uncertainty and a lead time for adding capacity creates the risk of capacity shortage during the lead time. We formulate a model of capacity expansion for uncertain exponential demand growth and deterministic expansion lead times when there is an obligation to provide a specified level of service. The service level, defined in terms of the ratio of expected lead time s...

Abstract. In this work, it has been shown that the combined use of exponential operators and integral transforms provides a powerful tool to solve time fractional generalized KdV of order 2q+1 and certain fractional PDEs. It is shown that exponential operators are an effective method for solving certain fractional linear equations with non-constant coefficients. It may be concluded that the com...

In this paper we study the notion of parameterized exponential time complexity. We show that a parameterized problem can be solved in parameterized 2o(f (k))p(n) time if and only if it is solvable in time O(2δf (k)q(n)) for any constant δ > 0, where p and q are polynomials. We then illustrate how this equivalence can be used to show that special instances of parameterized NP-hard problems are a...

In this paper we investigate effective versions of Hausdorff dimension which have been recently introduced by Lutz. We focus on dimension in the class E of sets computable in linear exponential time. We determine the dimension of various classes related to fundamental structural properties including different types of autoreducibility and immunity. By a new general invariance theorem for resour...

eNCE (edge label neighborhood controlled) graph grammars belong to the most powerful graph rewriting systems with single-node graphs on the left-hand side of the productions. From an algorithmic point of view, connuent and boundary eNCE graph grammars are the most interesting subclasses of eNCE graph grammars. In connuent eNCE graph grammars, the order in which nonterminal nodes are substituted...