scispace - formally typeset
Search or ask a question
Institution

École normale supérieure de Cachan

EducationCachan, Île-de-France, France
About: École normale supérieure de Cachan is a education organization based out in Cachan, Île-de-France, France. It is known for research contribution in the topics: Decidability & Finite element method. The organization has 2717 authors who have published 5585 publications receiving 175925 citations.


Papers
More filters
Book ChapterDOI
22 Sep 2014
TL;DR: First an interval iteration algorithm is introduced, for which the stopping criterion is straightforward, and the rate of convergence rate is analyzed, which significantly improves the bound on the number of iterations required to get the exact values.
Abstract: Markov Decision Processes (MDP) are a widely used model including both non-deterministic and probabilistic choices. Minimal and maximal probabilities to reach a target set of states, with respect to a policy resolving non-determinism, may be computed by several methods including value iteration. This algorithm, easy to implement and efficient in terms of space complexity, consists in iteratively finding the probabilities of paths of increasing length. However, it raises three issues: (1) defining a stopping criterion ensuring a bound on the approximation, (2) analyzing the rate of convergence, and (3) specifying an additional procedure to obtain the exact values once a sufficient number of iterations has been performed. The first two issues are still open and for the third one a “crude” upper bound on the number of iterations has been proposed. Based on a graph analysis and transformation of MDPs, we address these problems. First we introduce an interval iteration algorithm, for which the stopping criterion is straightforward. Then we exhibit convergence rate. Finally we significantly improve the bound on the number of iterations required to get the exact values.

52 citations

Journal ArticleDOI
TL;DR: In this paper, the authors considered the case where the distance between the holes tends to zero but remains large with respect to their characteristic size, and they gave a complete multiscale asymptotic expansion of the solution to the Laplace equation.
Abstract: The presence of small inclusions modifies the solution of the Laplace equation posed in a reference domain Ω0. This question has been studied extensively for a single inclusion or well-separated inclusions. In two-dimensional situations, we investigate the case where the distance between the holes tends to zero but remains large with respect to their characteristic size. We first consider two perfectly insulated inclusions. In this configuration we give a complete multiscale asymptotic expansion of the solution to the Laplace equation. We also address the situation of a single inclusion close to a singular perturbation of the boundary ∂Ω0. We also present numerical experiments implementing a multiscale superposition method based on our first order expansion.

52 citations

Book ChapterDOI
28 Aug 2010
TL;DR: The basic theory of LCM's and their verification problems are surveyed, with a focus on the decidability/undecidability divide.
Abstract: Lossy counter machines (LCM's) are a variant of Minsky counter machines based on weak (or unreliable) counters in the sense that they can decrease nondeterministically and without notification. This model, introduced by R. Mayr [TCS 297:337-354 (2003)], is not yet very well known, even though it has already proven useful for establishing hardness results. In this paper we survey the basic theory of LCM's and their verification problems, with a focus on the decidability/undecidability divide.

52 citations

Journal ArticleDOI
TL;DR: The extension of the alternating-time temporal logic (ATL) with strategy contexts is studied: contrary to the original semantics, in this semantics the strategy quantifiers do not reset the previously selected strategies.
Abstract: We study the extension of the alternating-time temporal logic (ATL) with strategy contexts: contrary to the original semantics, in this semantics the strategy quantifiers do not reset the previously selected strategies.We show that our extension ATL s c is very expressive, but that its decision problems are quite hard: model checking is k-EXPTIME-complete when the formula has k nested strategy quantifiers; satisfiability is undecidable, but we prove that it is decidable when restricting to turn-based games. Our algorithms are obtained through a very convenient translation to QCTL (the computation-tree logic CTL extended with atomic quantification), which we show also applies to Strategy Logic, as well as when strategy quantification ranges over memoryless strategies.

52 citations

Journal ArticleDOI
TL;DR: In this paper, the authors theoretically investigate the quantum statistical properties of light transmitted through an atomic medium with strong optical nonlinearity induced by Rydberg-Rydberg van der Waals interactions.
Abstract: We theoretically investigate the quantum statistical properties of light transmitted through an atomic medium with strong optical nonlinearity induced by Rydberg-Rydberg van der Waals interactions. In our setup, atoms are located in a cavity and nonresonantly driven on a two-photon transition from their ground state to a Rydberg level via an intermediate state by the combination of the weak signal field and a strong control beam. To characterize the transmitted light, we compute the second-order correlation function $g^{(2)}(\tau)$. The simulations we obtained on the specific case of rubidium atoms suggest that the bunched or antibunched nature of the outgoing beam can be chosen at will by tuning the physical parameters appropriately.

52 citations


Authors

Showing all 2722 results

NameH-indexPapersCitations
Shi Xue Dou122202874031
Olivier Hermine111102643779
John R. Reynolds10560750027
Shaul Mukamel95103040478
Tomás Torres8862528223
Ifor D. W. Samuel7460523151
Serge Abiteboul7327824576
Stéphane Roux6862719123
Zeger Debyser6740416531
Louis Nadjo6426412596
Praveen K. Thallapally6419012110
Andrew Travers6319313537
Shoji Takeuchi6369214704
Bineta Keita6327412053
Yves Mély6236813478
Network Information
Related Institutions (5)
École Polytechnique Fédérale de Lausanne
98.2K papers, 4.3M citations

92% related

École Normale Supérieure
99.4K papers, 3M citations

91% related

Georgia Institute of Technology
119K papers, 4.6M citations

91% related

University of Paris-Sud
52.7K papers, 2.1M citations

90% related

University of Paris
174.1K papers, 5M citations

90% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20233
202222
202121
202029
201958
201879