Displaying similar documents to “Homogenization of highly oscillating boundaries and reduction of dimension for a monotone problem”

Asymptotic behavior of the hitting time, overshoot and undershoot for some Lévy processes

Bernard Roynette, Pierre Vallois, Agnès Volpi (2007)

ESAIM: Probability and Statistics


Let () be a Lévy process started at , with Lévy measure . We consider the first passage time of () to level , and the overshoot and the undershoot. We first prove that the Laplace transform of the random triple () satisfies some kind of integral equation. Second, assuming that admits exponential moments, we show that ( T x ˜ , K x , L x ) converges in distribution as → ∞, where T x ˜ denotes a suitable renormalization of .

Non-Trapping sets and Huygens Principle

Dario Benedetto, Emanuele Caglioti, Roberto Libero (2010)

ESAIM: Mathematical Modelling and Numerical Analysis


We consider the evolution of a set Λ 2 according to the Huygens principle: the domain at time , Λ, is the set of the points whose distance from is lower than . We give some general results for this evolution, with particular care given to the behavior of the perimeter of the evoluted set as a function of time. We define a class of sets (non-trapping sets) for which the perimeter is a continuous function of , and we give an algorithm to approximate the evolution. Finally we restrict...

Towards parametrizing word equations

H. Abdulrab, P. Goralčík, G. S. Makanin (2010)

RAIRO - Theoretical Informatics and Applications


Classically, in order to resolve an equation ≈ over a free monoid *, we reduce it by a suitable family of substitutions to a family of equations ≈ , f , each involving less variables than ≈ , and then combine solutions of ≈ into solutions of ≈ . The problem is to get in a handy form. The method we propose consists in parametrizing the path traces in the so called associated to ≈ . We carry out such a parametrization in the case the prime equations in the graph involve at...

On the power of randomization for job shop scheduling with -units length tasks

Tobias Mömke (2008)

RAIRO - Theoretical Informatics and Applications


In the job shop scheduling problem -- , there are machines and each machine has an integer processing time of at most time units. Each job consists of a permutation of tasks corresponding to all machines and thus all jobs have an identical dilation . The contribution of this paper are the following results; (i) for d = o ( D ) jobs and every fixed , the makespan of an optimal schedule is at most , which extends the result of [3] for ; (ii) a randomized on-line approximation...