• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 61
  • 47
  • 13
  • 11
  • 10
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 155
  • 39
  • 27
  • 26
  • 25
  • 23
  • 22
  • 21
  • 20
  • 18
  • 18
  • 18
  • 17
  • 16
  • 16
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Environment behavior models for real-time reactive system testing automation

Aksu, Muharrem Ugur. January 2006 (has links) (PDF)
Thesis (M.S. in Computer Science and M.S. in Software Engineering)--Naval Postgraduate School, September 2006. / Thesis Advisor(s): Mikhail Auguston, Man-Tak Shing. "September 2006." Includes bibliographical references (p. 71-). Also available in print.
2

Topics in computation

Thorup, Mikkel January 1993 (has links)
No description available.
3

Regulated Grammars: Concepts, Properties and Applications / Regulated Grammars: Concepts, Properties and Applications

Bednář, Petr January 2016 (has links)
Tato práce se zabývá regulovanými gramatikami. Zavádí nové modifikace existujících regulovaných gramatik. Pro tyto modifikace zavádí metody syntaktické analýzi. Diskutuje problémy determinismu v definici gramatik. Studuje sílu nově uvedených modifikací aplikovaných na regulárně regulované gramatiky.
4

A grammatical approach to non-speech audio communication

Hankinson, John C. K. January 2000 (has links)
No description available.
5

The knowledge and processing underlying the structural mere exposure effect

Helman, Shaun January 2000 (has links)
No description available.
6

TELEMETRY AS AUTOMATA

Jones, Charles H. 11 1900 (has links)
International Telemetering Conference Proceedings / October 30-November 02, 1995 / Riviera Hotel, Las Vegas, Nevada / In its simplest form an automaton can be considered a set of inputs, a process, and a set of outputs. Certainly telemetry can be thought of in this way as well. Automata theory is a cross between mathematics and computer science which considers how to precisely define the inputs, the outputs, and the process of translating the one into the other. The input to an automaton can be described using a formal grammar. Two standard bit stream encodings, PCM matrices and MIL-STD-1553, are described using grammars. An example of how a grammar can be used to decode a bit stream is given. Further, ambiguity and complexity of bit stream encodings are discussed in the context of grammars. It is thus illustrated how grammars can be used to cleanly define and decode telemetry bit streams.
7

Evolução de split grammars para otimização de construções procedurais / Split grammar evolution for the optimization of procedural buildings

Rodrigues, Francisco Caio Maia January 2014 (has links)
RODRIGUES, Francisco Caio Maia. Evolução de split grammars para otimização de construções procedurais. 2014. 49 f. Dissertação (Mestrado em Ciência da Computação)-Universidade Federal do Ceará, Fortaleza, 2014. / Submitted by Anderson Silva Pereira (anderson.pereiraaa@gmail.com) on 2017-01-10T18:58:03Z No. of bitstreams: 1 2014_dis_fcmrodrigues.pdf: 6745695 bytes, checksum: 7fd10d5fff50663bf084d4eb5ad0a949 (MD5) / Approved for entry into archive by Rocilda Sales (rocilda@ufc.br) on 2017-01-11T15:39:12Z (GMT) No. of bitstreams: 1 2014_dis_fcmrodrigues.pdf: 6745695 bytes, checksum: 7fd10d5fff50663bf084d4eb5ad0a949 (MD5) / Made available in DSpace on 2017-01-11T15:39:12Z (GMT). No. of bitstreams: 1 2014_dis_fcmrodrigues.pdf: 6745695 bytes, checksum: 7fd10d5fff50663bf084d4eb5ad0a949 (MD5) Previous issue date: 2014 / Procedural modeling has been successfully applied to the automatic building generation problem. Among several techniques to tackle the problem of procedural building generation, the use of Split Grammars has increased, even being deployed in commercial CAAD (Computer-Aided Architectural Design) software. This work proposes a technique to optimize Split Grammars using Genetic Algorithm. The main goal is to automatically create grammars that only generate models with certain desirable characteristics, either from a series of manually written grammars or randomly created ones. The proposed thecnique searches the space of the input grammars’s rules to develop new better grammars, i.e., grammars that generate models with certain predefined feature. The proposed technique was successfully applied, as will be shown, to the maximization of symmetry of building facades, leading to the creation of realistic models. / Modelagem procedural tem sido aplicada com sucesso para resolver o problema da construção automática de ambientes urbanos. Dentre as várias técnicas existentes para a geração procedural de construções utilizando gramáticas, Split Grammars têm especial destaque devido ao seu amplo uso, estando presente até mesmo em softwares comerciais de CAAD (Computer-Aided Architectural Design). Este trabalho propõe uma técnica para otimização de Split Grammars utilizando algoritmos genéticos. O objetivo é gerar, automaticamente, gramáticas capazes de criar modelos que apresentem alguma característica desejada, seja a partir de uma série de gramáticas feitas manualmente por um usuário ou de gramáticas geradas aleatoriamente. O método proposto realiza uma busca no espaço das regras das gramáticas dadas como entrada a fim de criar novos tipos de gramáticas melhores, ou seja, que possuam uma boa estrutura de acordo com algum critério pré-definido pelo usuário. Assim, é demonstrada a eficácia da técnica proposta aplicando-a ao problema de maximização de simetria em fachadas de construções, obtendo modelos realisticamente plausíveis.
8

A linguistic method for robot verification programming and control

Dantam, Neil Thomas 07 January 2016 (has links)
There are many competing techniques for specifying robot policies, each having advantages in different circumstances. To unify these techniques in a single framework, we use formal language as an intermediate representation for robot behavior. This links previously disparate techniques such as temporal logics and learning from demonstration, and it links data driven approaches such as semantic mapping with formal discrete event and hybrid systems models. These formal models enable system verification -- a crucial point for physical robots. We introduce a set of rewrite rules for hybrid systems and apply it automatically build a hybrid model for mobile manipulation from a semantic map. In the manipulation domain, we develop a new workspace interpolation methods which provides direct, non-stop motion through multiple waypoints, and we introduce a filtering technique for online camera registration to avoid static calibration and handle changing camera positions. To handle concurrent communication with embedded robot hardware, we develop a new real-time interprocess communication system which offers lower latency than Linux sockets. Finally, we consider how time constraints affect the execution of systems modeled hierarchically using context-free grammars. Based on these constraints, we modify the LL(1) parser generation algorithm to operate in real-time with bounded memory use.
9

Cestami řízené gramatiky / Path-Controlled Grammars

Adamec, Ondřej January 2015 (has links)
This thesis deals with path-controlled grammars, which are grammars that place restrictions on the paths in a derivation tree of a context-free grammar. The goal of this thesis is to create an algorithm for conversion between the path-controlled grammars and the state grammars, which is a di erent type of regulated grammars. Another goal is to study the generative power of path-controlled grammars based on the conversion algorithm. The conversion algorithm is implemented and tested on a number of path-controlled grammars. Also, its complexity is discussed. Finally, a parsing tool for path-controlled grammars is implemented. Complexity of this tool is analyzed as well.
10

Regulated Grammar Systems / Regulated Grammar Systems

Tomko, Martin January 2018 (has links)
Práce poskytuje přehled základů teorie formálních jazyků, regulovaných gramatik a analýzy LL(1) jazyků. Je zde navržen a analyzován algoritmus pro analýzu programovaných gramatik, inspirován LL(1) analyzátorem. Třída jazyků přijímaná tímto algoritmem je striktní nadtřídou LL(1) jazyků, obsahující některé jazyky, které nejsou bezkontextové. Tato třída se však jeví být neporovnatelná s třídou bezkontextových jazyků.

Page generated in 0.0513 seconds