Results 61 to 70 of about 626,452 (200)
Las insistencias de lo real. Escenas de reescritura en narrativas de no ficción argentinas
Cuadernos LIRICOThis article explores the question of rewriting as it is presented in nonfiction narratives, based on a series of Argentine texts that include Rodolfo Walsh's Operación masacre (1957), Tomás Eloy Martínez's La pasión según Trelew (1973) and María Moreno ...
Victoria García
doaj +1 more source
, 1989 Proposed far-reaching changes in the Federal Rules of Evidence are of major practical significance to every lawyer involved in the criminal justice process.
Rothstein, Paul F
core +1 more source
Julia: A Fresh Approach to Numerical Computing [PDF]
SIAM Review, 2014 Bridging cultures that have often been distant, Julia combines expertise from the diverse fields of computer science and computational science to create a new approach to numerical computing.
Jeff Bezanson +3 more
semanticscholar +1 more source
Complexity of Conditional Term Rewriting [PDF]
Logical Methods in Computer Science, 2017 We propose a notion of complexity for oriented conditional term rewrite systems satisfying certain restrictions. This notion is realistic in the sense that it measures not only successful computations, but also partial computations that result in a ...
Cynthia Kop +2 more
doaj +1 more source
Argument filterings and usable rules in higher-order rewrite systems [PDF]
, 2010 The static dependency pair method is a method for proving the termination of higher-order rewrite systems a la Nipkow. It combines the dependency pair method introduced for first-order rewrite systems with the notion of strong computability introduced ...
Blanqui, Frédéric +2 more
core +8 more sources
An introduction to PYTHIA 8.2 [PDF]
Computer Physics Communications, 2014 The Pythia program is a standard tool for the generation of events in high-energy collisions, comprising a coherent set of physics models for the evolution from a few-body hard process to a complex multiparticle final state. It contains a library of hard
T. Sjöstrand +9 more
semanticscholar +1 more source
Interactions between Causal Structures in Graph Rewriting Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Graph rewrite formalisms are a powerful approach to modeling complex molecular systems. They capture the intrinsic concurrency of molecular interactions, thereby enabling a formal notion of mechanism (a partially ordered set of events) that explains how ...
Ioana Cristescu +2 more
doaj +1 more source
Constraint contextual rewriting
Journal of Symbolic Computation, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ARMANDO, ALESSANDRO, RANISE S.
openaire +2 more sources
Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 In the dependency pair framework for proving termination of rewriting systems, polynomial interpretations are used to transform dependency chains into bounded decreasing sequences of integers, and they play an important role for the success of proving ...
Tomohiro Sasano +3 more
doaj +1 more source
Modular Complexity Analysis for Term Rewriting [PDF]
, 2014 All current investigations to analyze the derivational complexity of term rewrite systems are based on a single termination method, possibly preceded by transformations. However, the exclusive use of direct criteria is problematic due to their restricted
Korp, Martin, Zankl, Harald
core +1 more source