755 research outputs found
Streamability of Nested Word Transductions
No full textWe consider the problem of evaluating in streaming (i.e. in a single left-to-right pass) a nested word transduction with a limited amount of memory. A transduction T is said to be height bounded memory (HBM) if it can be evaluated with a memory that depends only on the size of T and on the height of the input word. We show that it is decidable in CONPTIME for a nested word transduction defined by a visibly pushdown transducer (VPT), if it is HBM. In this case, the required amount of memory may depend exponentially on the height of the word. We exhibit a sufficient, decidable condition for a VPT to be evaluated with a memory that depends quadratically on the height of the word. This condition defines a class of transductions that strictly contains all determinizable VPTs. © Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, and Frédéric Servais.SCOPUS: cp.pinfo:eu-repo/semantics/publishe
La Pierre de Jaignes
No full textReynier Ph. La Pierre de Jaignes. In: Bulletin de la Société préhistorique de France, tome 9, n°9, 1912. pp. 551-552
Entretien autour de quelques cartes avec Yves Reynier
No full textReynier Yves, Manuel Pierre. Entretien autour de quelques cartes avec Yves Reynier. In: Horizons Maghrébins - Le droit à la mémoire, N°48, 2003. Des tours de mains autour de la méditerranée. pp. 92-95
Découverte de Pièces Néolithiques et d'une Pierre à cuvette sur le territoire d'Armentières (Seine-et-Marne)
No full textReynier Ph. Découverte de Pièces Néolithiques et d'une Pierre à cuvette sur le territoire d'Armentières (Seine-et-Marne). In: Bulletin de la Société préhistorique de France, tome 10, n°3, 1913. pp. 183-185
Einige Bemerkungen über siebzehn Fälle von Wirbelfracturen, die auf der chirurgischen Klinik von Prof. Dr. Kocher zu Bern, vom Jahre 1865-1884, vorgekommen sind
No full textvon Edouard de ReynierDiss. med. Bern, 188
Christine Reynier, Virginia Woolf’s Good Housekeeping Essays
No full textIn Virginia Woolf’s Good Housekeeping Essays, published by Routledge in their ‘Literary Texts and the Popular Marketplace’ collection in 2019, Christine Reynier decides to take a series of six texts published by Woolf in the 1930s very seriously. It is very likely that few people apart from Woolf scholars will have heard of these essays, let alone read them, published in a second-rate magazine dedicated to fashion. Bringing them to our attention in a monograph enables the author to literally ..
Modernist Non-fictional Narratives and Beyond (e-Rea 15.2, 2018)
No full textA few years ago, I co-edited a first issue of e-Rea on modernist non-fictional prose. It came as the joint and somewhat indirect result of a long-term personal work on Virginia Woolf’s essays as well as a series of crucial academic encounters. While working on Virginia Woolf’s short stories (Reynier 2009), I had come to be interested in the way in which the author theorised the short story genre in her essays; this turned into an article some time later (Reynier 2015) and confirmed in a way ..
Jacques de Reynier. 1948, à Jérusalem
No full textColin. Jacques de Reynier. 1948, à Jérusalem. In: Politique étrangère, n°2 - 2003 - 68ᵉannée. pp. 446-447
Aventures de Robinson Crusoé / Daniel de Foë ; adaptation de Marguerite Reynier ; illustrations de Pierre Noury
No full textContient une table des matièresAvec mode text
Reaching Your Goal Optimally by Playing at Random with No Memory
No full textInternational audienceShortest-path games are two-player zero-sum games played on a graph equipped with integer weights. One player, that we call Min, wants to reach a target set of states while minimising the total weight, and the other one has an antagonistic objective. This combination of a qualitative reachability objective and a quantitative total-payoff objective is one of the simplest settings where Min needs memory (pseudo-polynomial in the weights) to play optimally. In this article, we aim at studying a tradeoff allowing Min to play at random, but using no memory. We show that Min can achieve the same optimal value in both cases. In particular, we compute a randomised memoryless ε-optimal strategy when it exists, where probabilities are parametrised by ε. We also show that for some games, no optimal randomised strategies exist. We then characterise, and decide in polynomial time, the class of games admitting an optimal randomised memoryless strategy
- …
