• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 72
  • 35
  • 9
  • 7
  • Tagged with
  • 123
  • 54
  • 49
  • 38
  • 38
  • 31
  • 31
  • 25
  • 25
  • 25
  • 18
  • 16
  • 14
  • 10
  • 9
  • 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.
71

Graphentheoretischer Ansatz zur Initialdimensionierung analoger Schaltungen

Boos, Volker 08 June 2007 (has links) (PDF)
Beim analogen Schaltungsentwurf werden zur Dimensionierung der Bauelemente Optimierungstools eingesetzt, um eine optimale Performance und maximale Robustheit zu erreichen. Beginnend mit einer Anfangslösung berechnen diese Tools iterativ bessere Lösungen. Dabei kann eine gute Anfangslösung die Rechenzeit stark verkürzen und den Optimierungserfolg verbessern. Untersuchungen haben gezeigt, dass die Optimierung wesentlich leichter zu beherrschen ist, wenn an den Bauelementen bestimmte DC-Bedingungen (Constraints) erfüllt sind. In diesem Beitrag wird gezeigt, wie durch graphentheoretische Ansätze die optimalen Knotenspannungen und Zweigströme mit geringem Rechenaufwand ermittelt werden und daraus die Dimensionierung der Bauelemente als gute Startlösung für Optimierungstools berechnet wird.
72

Mean Eigenvalue Counting Function Bound for Laplacians on Random Networks

Samavat, Reza 22 January 2015 (has links) (PDF)
Spectral graph theory widely increases the interests in not only discovering new properties of well known graphs but also proving the well known properties for the new type of graphs. In fact all spectral properties of proverbial graphs are not acknowledged to us and in other hand due to the structure of nature, new classes of graphs are required to explain the phenomena around us and the spectral properties of these graphs can tell us more about the structure of them. These both themes are the body of our work here. We introduce here three models of random graphs and show that the eigenvalue counting function of Laplacians on these graphs has exponential decay bound. Since our methods heavily depend on the first nonzero eigenvalue of Laplacian, we study also this eigenvalue for the graph in both random and nonrandom cases.
73

Robust flight gate assignment /

Jaehn, Florian. January 1900 (has links)
Thesis (Ph. D.)--Universität-Gesamthochschule-Siegen, 2007. / Includes bibliographical references (p. 123-129).
74

Centralisers of fundamental subgroups

Altmann, Kristina. Unknown Date (has links) (PDF)
Darmstadt, Techn. University, Diss., 2007.
75

Robust flight gate assignment /

Jaehn, Florian. January 2008 (has links)
Univ., Diss.--Siegen, 2007.
76

Network snakes /

Butenuth, Matthias. January 2008 (has links)
Zugl.: Hannover, University, Diss., 2008.
77

Simplicial complexes of graphs /

Jonsson, Jakob, January 1900 (has links)
Thesis (Ph. D.)--Royal Institute of Technology, Stockholm, 2005.
78

Implementierung eines Algorithmus zur Partitionierung von Graphen

Riediger, Steffen. Lanka, André, January 2007 (has links)
Chemnitz, Techn. Univ., Studienarb., 2007.
79

Convex mathematical programs for relational matching of object views

Schellewald, Christian. Unknown Date (has links) (PDF)
University, Diss., 2005--Mannheim. / Erscheinungsjahr an der Haupttitelstelle: 2004.
80

Graph partitioning - a survey

Elsner, Ulrich 09 September 2005 (has links)
Many problems appearing in scientific computing and other areas can be formulated as a graph partitioning problems. Examples include data distribution for parallel computers, decomposition of sparse matrices and VLSI-design. In this survey we present the graph partitioning problem, describe some applications and introduce many of the algorithms used to solve the problem.

Page generated in 0.3992 seconds