• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 100
  • 23
  • 16
  • 6
  • 6
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 174
  • 174
  • 47
  • 36
  • 27
  • 27
  • 26
  • 21
  • 19
  • 19
  • 16
  • 16
  • 16
  • 13
  • 12
  • 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.
61

Numerical Bifurcation Analysis Of Cosymmetric Dynamical Systems

Gemici, Omer Caner 01 March 2003 (has links) (PDF)
In this thesis, bifurcation phenomena in dynamical systems with cosymmetry and Hamiltonian structure were investigated using numerical methods. Several numerical continuation methods and test functions for detecting bifurcations were presented. The numerical results for various examples are given using a numerical bifurcation analysis toolbox.
62

Graphs and subgraphs with bounded degree

Teska, Jakub January 2008 (has links)
"The topology of a network (such as a telecommunications, multiprocessor, or local area network, to name just a few) is usually modelled by a graph in which vertices represent 'nodes' (stations or processors) while undirected or directed edges stand for 'links' or other types of connections, physical or virtual. A cycle that contains every vertex of a graph is called a hamiltonian cycle and a graph which contains a hamiltonian cycle is called a hamiltonian graph. The problem of the existence of a hamiltonian cycle is closely related to the well known problem of a travelling salesman. These problems are NP-complete and NP-hard, respectively. While some necessary and sufficient conditions are known, to date, no practical characterization of hamiltonian graphs has been found. There are several ways to generalize the notion of a hamiltonian cycle. In this thesis we make original contributions in two of them, namely k-walks and r-trestles." --Abstract. / Doctor of Philosophy
63

Graphs and subgraphs with bounded degree

Teska, Jakub . University of Ballarat. January 2008 (has links)
"The topology of a network (such as a telecommunications, multiprocessor, or local area network, to name just a few) is usually modelled by a graph in which vertices represent 'nodes' (stations or processors) while undirected or directed edges stand for 'links' or other types of connections, physical or virtual. A cycle that contains every vertex of a graph is called a hamiltonian cycle and a graph which contains a hamiltonian cycle is called a hamiltonian graph. The problem of the existence of a hamiltonian cycle is closely related to the well known problem of a travelling salesman. These problems are NP-complete and NP-hard, respectively. While some necessary and sufficient conditions are known, to date, no practical characterization of hamiltonian graphs has been found. There are several ways to generalize the notion of a hamiltonian cycle. In this thesis we make original contributions in two of them, namely k-walks and r-trestles." --Abstract. / Doctor of Philosophy
64

Applications of Bogomolny's semiclassical quantization to integrable and nonintegrable systems.

Lefebvre, Marie Helene Julie. Goodings, David A. Unknown Date (has links)
Thesis (Ph.D.)--McMaster University (Canada), 1995. / Source: Dissertation Abstracts International, Volume: 57-03, Section: B, page: 1854. Adviser: D. A. Goodings.
65

Renormalization of continuous-time dynamical systems with KAM applications

Kocić, Saša, January 1900 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2006. / Vita. Includes bibliographical references.
66

An examination of elastic collision dynamics in strong infrarated laser fields /

Matusek, Daniel Robert, January 1900 (has links)
Thesis (Ph. D.)--Carleton University, 2003. / Includes bibliographical references (p. 262-286). Also available in electronic format on the Internet.
67

The U-transformation and the Hamiltonian techniques for the finite strip method /

Li, Ying. January 1996 (has links)
Thesis (Ph. D.)--University of Hong Kong, 1996. / Includes bibliographical references (leaf 181-194).
68

Oscillators resonances and excitations /

Felts, K. R., Chicone, Carmen Charles. January 2009 (has links)
Title from PDF of title page (University of Missouri--Columbia, viewed on Feb 11, 2010). The entire thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file; a non-technical public abstract appears in the public.pdf file. Dissertation advisor: Dr. Carmen Chicone Vita. Includes bibliographical references.
69

Secure multiparty computation

Dong, Renren. January 2009 (has links)
Thesis (M.S.)--Bowling Green State University, 2009. / Document formatted into pages; contains vii, 66 p. Includes bibliographical references.
70

On the N-body problem /

Xie, Zhifu, January 2006 (has links) (PDF)
Thesis (Ph. D.)--Brigham Young Dept. of Mathematics, 2006. / Includes bibliographical references (p. 87-90).

Page generated in 0.0823 seconds