Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 287 for “"rewriting"”.

  1. Rewriting Myself

    Short fiction and poetry.

    kennesaw Repository record for Rewriting Myself (opens in a new tab)

  2. Rewriting Prover9

    Prover9/Mace4 were the most popular automated theorem provers (ATP) among mathematicians. They had a number of peculiarities that made them especially helpful for research and for teaching. When their author, Bill McCune, died the programs’ destiny was sealed and that was a great loss for many …

    aberta Repository record for Rewriting Prover9 (opens in a new tab)

  3. Rewriting the Boundaries

    This thesis examines contemporary British experimental theatre of the 1990s and its relation to postmodern cultural theory. The practitioners discussed include Forced Entertainment, Third Angel, Stan’s Cafe, Blast Theory and Desperate Optimists, who were all practising during the 1990s in Britain, …

    de-montfort Repository record for Rewriting the Boundaries (opens in a new tab)

  4. ProverX: rewriting and extending prover9

    O propósito principal deste projecto é tornar o demonstrador automático de teoremas Prover9 programável e, por conseguinte, extensível. Este propósito foi conseguido acrescentando um interpretador de Python, uma linha de comandos e uma biblioteca de módulos, objectos e funções escritos em Python …

    aberta Repository record for ProverX: rewriting and extending prover9 (opens in a new tab)

  5. Rewriting Products of Group Elements

    Let G be a group and let n be an integer greater than 1. An n-tuple $({\rm x\sb1,\dots, x\sb{n}})$ of elements of G is said to be rewriteable if there is a nontrivial permutation $\sigma$ in Sym(n) such that ${\rm x\sb1\dots x\sb{n} = x\sb{\sigma (1)}\dots x\sb{\sigma (n)}}.$ A subset $\{ {\rm …

    uiuc Repository record for Rewriting Products of Group Elements (opens in a new tab)

  6. Rewriting-based model checking methods

    … logics and conventional programming languages. Rewriting logic is a highly expressive computational logic for effectively defining a formal executable semantics of a wide range of system specification languages. This dissertation presents new rewriting-based model checking methods and tools to …

    uiuc Repository record for Rewriting-based model checking methods (opens in a new tab)

  7. Strategic Modelling with Graph Rewriting Tools

    … and convey intuitions or ideas about it. Graph rewriting rules can be used to model their dynamic evolution and from a practical point of view, graph transformations have many applications in specification, programming, and simulation tools. Strategic rewriting has been studied for term …

    kings Repository record for Strategic Modelling with Graph Rewriting Tools (opens in a new tab)

  8. Implementation techniques for rewriting and narrowing

    … that can be used to compute by repeatedly rewriting an initial term until a final form is obtained. Such systems provide a nondeterministic programming language having convenient mathematical properties. Programs are easy to understand, as they have very simple syntax and semantics, based …

    uiuc Repository record for Implementation techniques for rewriting and narrowing (opens in a new tab)

  9. Rewriting the genome of Escherichia coli

    Our recently acquired ability to synthesize DNA at large scale is opening the door to writing entire genomes; this constitutes a powerful approach to address fundamental biological questions, and may enable the creation of designer organisms with useful properties. One interesting avenue for …

    cambridge Repository record for Rewriting the genome of Escherichia coli (opens in a new tab)

  10. Rewriting the Rules of a Classifier

    … in the network as desired, referred to as the rewriting technique. We demonstrate that using our rewriting technique and simple human knowledge about how to classify the world around us, we can generalize existing classes to unseen variants, identify spurious correlations present in the …

    mit Repository record for Rewriting the Rules of a Classifier (opens in a new tab)

  11. Intuitionistic fuzzy XML query matching and rewriting

    … approach for approximate XML query matching and rewriting which aims at achieving soft matching of XML queries with XML data sources following different schemas. Unlike traditional querying approaches, which require exact matching, the proposed approach makes use of Intuitionistic Fuzzy Trees to …

    westminster Repository record for Intuitionistic fuzzy XML query matching and rewriting (opens in a new tab)

  12. Rewriting Hmong womanhood: literacy that mediates borders

    In “Rewriting Hmong Womanhood,” I argue that the revision of cultural gender roles for migrant women comes about through relocating literacies: moving family and home literacies across borders to public spaces such as schools, workplaces, and political realms while also using those same literacies …

    uiuc Repository record for Rewriting Hmong womanhood: literacy that mediates borders (opens in a new tab)

  13. Term rewriting system models of modern microprocessors

    Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.

    mit Repository record for Term rewriting system models of modern microprocessors (opens in a new tab)

  14. Practical Rewriting Techniques for Warded Ontology-Mediated Queries

    … is to fill the above gap by designing a novel rewriting algorithm for OMQs over warded ontologies which is more amenable to practical implementations, as well as providing an implementation and an experimental evaluation, with the aim of understanding which key input parameters affect the …

    trento Repository record for Practical Rewriting Techniques for Warded Ontology-Mediated Queries (opens in a new tab)

  15. Query Rewriting for Extracting Data behind HTML Forms

    Much of the information on the Web is stored in specialized searchable databases and can only be accessed by interacting with a form or a series of forms. As a result, enabling automated agents and Web crawlers to interact with form-based interfaces designed primarily for humans is of great value. …

    byu Repository record for Query Rewriting for Extracting Data behind HTML Forms (opens in a new tab)

  16. Rewriting urban narratives of the Australian Great Depression.

    Rewriting Narratives of the Australian Great Depression is a thesis consisting of a novel, Dadaville, and an exegesis. Inspired by a Max Ernst painting of the same name, Dadaville is set in Sydney in 1931, a city in the grip of brutal poverty. The unemployed riot as they are evicted from homes in …

    adelaide Repository record for Rewriting urban narratives of the Australian Great Depression. (opens in a new tab)

  17. Rewriting the aging body: literacy, technology, and history

    Millie Garfield gets out of bed each morning and makes a cup of coffee. She then goes to her computer and starts her day with a review of her favorite blogs, a visit to her son’s Twitter page, and a quick scan of reader comments on her own weekly blog posts. She looks forward to corresponding with …

    uiuc Repository record for Rewriting the aging body: literacy, technology, and history (opens in a new tab)

  18. Rewriting-based symbolic methods for distributed system verification

    … the goal of this research project is to develop rewriting-based symbolic analysis methods that (1) can analyze systems which need an unbounded amount of time and/or space (2) may be highly distributed (3) use modular specification techniques so that work is never wasted (4) are generic across a …

    uiuc Repository record for Rewriting-based symbolic methods for distributed system verification (opens in a new tab)

  19. An equality theorem prover based on grammar rewriting

    Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.

    mit Repository record for An equality theorem prover based on grammar rewriting (opens in a new tab)

Page 1 of 15