NDLTD logo NDLTD Union Catalog and Global ETD Search

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 510 for “"nets"”.

  1. Smarter NEAT Nets

    Dehaven, Ryan Swords2013

    <p>This paper discusses a modification to improve usability and functionality of a ge- netic neural net algorithm called NEAT (NeuroEvolution of Augmenting Topolo- gies). The modification aims to accomplish its goal by automatically changing parameters used by the algorithm with little input from a …

    calpoly Repository record

  2. Probability driven heuristic nets

    Carter, Lynn Robert

    portland-state Repository record

  3. Synthesis of Probabilistic Communication Nets

    Barnard, Herbert MarvinUniversity of Illinois at Urbana-Champaign2014

    Made available in DSpace on 2014-12-08T22:23:32Z (GMT). No. of bitstreams: 1 6500778.pdf: 1599233 bytes, checksum: c55f4fbb32c4888c4bfd53535578afdc (MD5) Previous issue date: 1964

    uiuc Repository record

  4. Decidability questions for Petri Nets.

    Hack, Michel Henri ThéodoreMassachusetts Institute of Technology1976

    Thesis. 1976. Ph.D.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

    mit Repository record

  5. Fault Diagnosis for Large Petri Nets

    Jiroveanu, George2006

    ghent Repository record

  6. Fault Diagnosis for Large Petri Nets

    Jiroveanu, G2006

    ghent Repository record

  7. Visual parallel programming via petri nets

    Passey, David Glenn

    <p>The objective of this paper is to determine the feasibility and produceability of a Petri net based CASE tool, thus the majority of this paper is the implementation and explanation thereof. The requirements of this implementation are as follows: a. Graphical input and manipulation of a Petri …

    eastern-wash Repository record

  8. Realization of Probabilistic Tree Communication Nets

    Ito, MasayasuUniversity of Illinois at Urbana-Champaign2014

    Made available in DSpace on 2014-12-10T19:07:15Z (GMT). No. of bitstreams: 1 7405602.pdf: 2447563 bytes, checksum: 587a20169bcd6add9c41adb9871d327c (MD5) Previous issue date: 1973

    uiuc Repository record

  9. Parallel retrieval algorithms for semantic nets

    Baek, Hae Jin.Massachusetts Institute of Technology1986

    Thesis: B.S., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 1986

    mit Repository record

  10. Computer aided design for Petri Nets

    Kyratzoglou, I. M. (Ioannis M.)Massachusetts Institute of Technology1987

    Thesis (Mech. E.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1987.

    mit Repository record

  11. Flow through and around fish farming nets

    Patursson, Oystein

    <p>Computational fluid dynamics (CFD) modeling, tow tank and field measurements were used to investigate current flow through and around net panels and cages. For the numerical computations a porous media model was used to represent the net allowing efficient computation of both exterior and …

    unh-thes Repository record

  12. Analysis and Synthesis of Lossy Communication Nets

    Onaga, KenjiUniversity of Illinois at Urbana-Champaign2014

    Made available in DSpace on 2014-12-08T22:23:49Z (GMT). No. of bitstreams: 1 6511847.pdf: 1676438 bytes, checksum: 6686110c8e840463d59aab5d9ac4237e (MD5) Previous issue date: 1965

    uiuc Repository record

  13. Hierarchical supervisory control of complex Petri nets

    Somnath, NishaUniversity of Illinois at Urbana-Champaign2012

    … complex systems that are modeled using Petri nets. The supervisory policy, when it exists, prevents the occurrence of certain events (i.e. activities) at specific states in such a way that the supervised system is livelock free. A hierarchical approach is used to find a supervisory policy for …

    uiuc Repository record

  14. Modifications of perineuronal nets to regulate plasticity

    van 't Spijker, Heleen MerelUniversity of Cambridge2019

    cambridge Repository record

  15. Performance analysis of Stochastic Timed Petri Nets

    Wiley, Richard PaulMassachusetts Institute of Technology1986

    Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1986.

    mit Repository record

  16. Message delay in communication nets with storage

    Kleinrock, LeonardMassachusetts Institute of Technology1963

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering, 1963.

    mit Repository record

  17. RIDDS: Removal of Irregular Debris Using Double Nets

    Coote, Kayann

    … Removal of Irregular Debris using Double Nets (RIDDs) is to shoot a series of nets to capture a target piece of orbital debris. To adapt to evolving needs, RIDDs utilizes a small CubeSat configuration but can easily be scaled up to capture larger debris. The goal of this research is to …

    embry-riddle Repository record

  18. Model predictive control of timed continuous petri nets

    Zhan, Huaiyu

    … control problem of timed continuous Petri nets. The theory of Model Predictive Control (MPC) is first discussed. Then continuous Petri nets (PN) are introduced as a powerful tool for modelling, simulation and analysis of discrete event/continuous systems. Their useful capabilities are …

    njit Repository record

  19. Using Deep Neural Nets in Writer Identification & Analysis

    Majithia, Aditya2025

    <p>This thesis focuses on developing automated deep learning methods for writer identification and writer attribute prediction from handwriting. It introduces two novel architectures: Convolutional Transformer Encoder (CTE) and Convolutional Swin Encoder (CSE). CTE is designed for determining …

    cuny Repository record

  20. Tetrahedra and Their Nets: Mathematical and Pedagogical Implications

    Mussa, Derege2013

    If one has three sticks (lengths), when can you make a triangle with the sticks? As long as any two of the lengths sum to a value strictly larger than the third length one can make a triangle. Perhaps surprisingly, if one is given 6 sticks (lengths) there is no simple way of telling if one can …

    columbia-diss Repository record

Page 1 of 26