Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Trees.

Dissertationen zum Thema „Trees“

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Trees" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Okoth, Isaac Owino. "Combinatorics of oriented trees and tree-like structures." Thesis, Stellenbosch : Stellenbosch University, 2015. http://hdl.handle.net/10019.1/96860.

Der volle Inhalt der Quelle
Annotation:
Thesis (PhD)--Stellenbosch University, 2015.<br>ENGLISH ABSTRACT : In this thesis, a number of combinatorial objects are enumerated. Du and Yin as well as Shin and Zeng (by a different approach) proved an elegant formula for the number of labelled trees with respect to a given in degree sequence, where each edge is oriented from a vertex of lower label towards a vertex of higher label. We refine their result to also take the number of sources (vertices of in degree 0) or sinks (vertices of out degree 0) into account. We find formulas for the mean and variance of the number of sinks or s
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Drinkwater, Kara M. "Trees." VCU Scholars Compass, 2006. http://hdl.handle.net/10156/1907.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Garton, Ian Spencer. "Concurrency in B-trees and tries : search and insert." Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=33400.

Der volle Inhalt der Quelle
Annotation:
Multiuser database systems require concurrency control in order to perform correctly. B-trees have become the standard data structure for storing indices that aid in data retrieval and there have been many algorithms published to enable concurrent operations for B-trees. Tries are another data structure useful for storing index data, particularly for text and spatial databases. Significant data compression can be achieved by using a trie to store index values. However, there have been no algorithms published to support concurrent trie operations.<br>We present algorithms that enable concurrent
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Hall, Justine Michelle. "Trees in towns : factors affecting the distribution of trees in high density residential areas of Greater Manchester." Thesis, University of Manchester, 2010. https://www.research.manchester.ac.uk/portal/en/theses/trees-in-towns-factors-affecting-the-distribution-of-trees-in-high-density-residential-areas-of-greater-manchester(568b58f3-4524-4a8d-abba-2094c4e21567).html.

Der volle Inhalt der Quelle
Annotation:
The distribution of trees across urban areas of the UK has been shown to be uneven, with lower density residential areas containing many more trees and much higher tree cover than areas of higher density housing. However, in Greater Manchester, tree number within high density housing areas also varies substantially. This thesis sought to explore the reasons for this variation in tree cover, whether tree cover should be increased and if so, how. The research investigated a potential cause for the variation in number of trees and tree cover within high density housing areas – housing type – for
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Abu-Ata, Muad Mustafa. "Tree-Like Structure in Graphs and Embedability to Trees." Kent State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=kent1397345185.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Bryant, David. "Building trees, hunting for trees, and comparing trees : theory and methods in phylogenetic analysis." Thesis, University of Canterbury. Mathematics and Statistics, 1997. http://hdl.handle.net/10092/7914.

Der volle Inhalt der Quelle
Annotation:
Phylogenetics is the study and identification of evolutionary patterns and structures in nature; this thesis explores the mathematics of these structures. The basic objects of study are the leaf labelled tree and its substructures: quartets, splits, clusters and rooted triples, among others. We present fundamental theorems and characterisations, as well as efficient algorithms for a range of phylogenetic problems. It is often possible to deduce phylogenetic information not in the original data. We characterise an intriguing system of inference 'rules' that arise in this way, and prove that th
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Balakrishnan, Anantaram, Thomas L. Magnanti, and Prakash Mirchandani. "Heuristics, LPs, and Generalizations of Trees on Trees." Massachusetts Institute of Technology, Operations Research Center, 1993. http://hdl.handle.net/1721.1/5377.

Der volle Inhalt der Quelle
Annotation:
We study a class of models, known as overlay optimization problems, with a "base" subproblem and an "overlay" subproblem, linked by the requirement that the overlay solution be contained in the base solution. In some telecommunication settings, a feasible base solution is a spanning tree and the overlay solution is an embedded Steiner tree (or an embedded path). For the general overlay optimization problem, we describe a heuristic solution procedure that selects the better of two feasible solutions obtained by independently solving the base and overlay subproblems, and establish worst-case per
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Magnanti, Thomas L., and Laurence A. Wolsey. "Optimal Trees." Massachusetts Institute of Technology, Operations Research Center, 1994. http://hdl.handle.net/1721.1/5122.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Prosser, Christopher Skinner 1978. "Two Trees." Thesis, University of Oregon, 2010. http://hdl.handle.net/1794/11048.

Der volle Inhalt der Quelle
Annotation:
1 score (viii, 79 p.) A print copy of this thesis is available through the UO Libraries. Search the library catalog for the location and call number.<br>The Two Trees is a fifteen-minute musical composition for orchestra. Inspired by William Butler Yeats' poem of the same name, the piece depicts the images described by Yeats' poetic narrative through a double theme and variations form consisting of two contrasting themes that are related, one ascending and one descending. Each theme represents one of the two contrasting sections of the poem and is followed by a set of five variations f
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Taylor, Paul Clifford. "Classification trees." Thesis, University of Bath, 1990. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306312.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
11

Balakrishnan, Anantaram, Thomas L. Magnanti, and Prakash Mirchandani. "Heuristics, LPs, and Trees on Trees: Network Design Analyses." Massachusetts Institute of Technology, Operations Research Center, 1994. http://hdl.handle.net/1721.1/5277.

Der volle Inhalt der Quelle
Annotation:
We study a class of models, known as overlay optimization problems, with a "base" subproblem and an "overlay" subproblem, linked by the requirement that the overlay solution be contained in the base solution. In some telecommunication settings, a feasible base solution is a spanning tree and the overlay solution is an embedded Steiner tree (or an embedded path). For the general overlay optimization problem, we describe a heuristic solution procedure that selects the better of two feasible solutions obtained by independently solving the base and overlay subproblems, and establish worst-case per
APA, Harvard, Vancouver, ISO und andere Zitierweisen
12

Choi, Myung Jin Ph D. Massachusetts Institute of Technology. "Trees and beyond : exploiting and improving tree-structured graphical models." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/62888.

Der volle Inhalt der Quelle
Annotation:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student submitted PDF version of thesis.<br>Includes bibliographical references (p. 169-179).<br>Probabilistic models commonly assume that variables are independent of each other conditioned on a subset of other variables. Graphical models provide a powerful framework for encoding such conditional independence stru
APA, Harvard, Vancouver, ISO und andere Zitierweisen
13

Skorin-Kapov, Darko. "On some problems on k-trees and partial k-trees." Thesis, University of British Columbia, 1989. http://hdl.handle.net/2429/29288.

Der volle Inhalt der Quelle
Annotation:
The objective of this thesis is to investigate some structural and algorithmic properties of k-trees and partial k-trees. A k-tree can be constructed from a k-complete graph by recursively adding a new vertex which is adjacent to all vertices of an existing k-complete subgraph. Partial k-trees are graphs embeddable in a k-tree with the same vertex set. They are natural generalizations of forests and series-parallel graphs which are the first two members of the hierarchy of partial k-trees. The many applications of k-trees and partial k-trees have motivated their study from both an algorithmic
APA, Harvard, Vancouver, ISO und andere Zitierweisen
14

Travis, David J., Vernon Meentemeyer, and Roger P. Belanger. "Stressed Trees Produce a Better Climatic Signal than Healthy Trees." Tree-Ring Society, 1990. http://hdl.handle.net/10150/261930.

Der volle Inhalt der Quelle
Annotation:
The basis for the selection of trees to be used in the production of dendrochronologies has long been an issue (Douglass 1946; Fritts 1976). In humid regions the common practice has been to use trees that appear to be in good health. As a part of a larger study involving the impact of ice storms on tree-ring increments (Travis 1989), we show that trees stressed as a result of ice damage produced a stronger climatic signal than nondamaged trees.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
15

Kirkby, Richard Brendon. "Improving Hoeffding Trees." The University of Waikato, 2008. http://hdl.handle.net/10289/2568.

Der volle Inhalt der Quelle
Annotation:
Modern information technology allows information to be collected at a far greater rate than ever before. So fast, in fact, that the main problem is making sense of it all. Machine learning offers promise of a solution, but the field mainly focusses on achieving high accuracy when data supply is limited. While this has created sophisticated classification algorithms, many do not cope with increasing data set sizes. When the data set sizes get to a point where they could be considered to represent a continuous supply, or data stream, then incremental classification algorithms are required. In th
APA, Harvard, Vancouver, ISO und andere Zitierweisen
16

Clark, David. "Compact PAT trees." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq21335.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
17

Kustra, Rafal. "Soft decision trees." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq28745.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
18

Kutscheid, Gloria J. "More than trees." Virtual Press, 1986. http://liblink.bsu.edu/uhtbin/catkey/473196.

Der volle Inhalt der Quelle
Annotation:
The purpose of this study was to complete a series of photographs utilizing trees as metaphors. This series of photographs is composed into book form for possible publication. It presents the psychological and symbolic impact of trees in different environments and from different perspectives through the development of a unique style of creative composition. The format consists of text and photographs. This project develops a working definition of metaphors and an approach using trees as the medium to convey various symbolic and psychological references. Both associated and inferred types of sy
APA, Harvard, Vancouver, ISO und andere Zitierweisen
19

Puch-Solis, Roberto O. "Hierarchical junction trees." Thesis, University of Warwick, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365243.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
20

Della-Libera, Giovanni M. (Giovanni Moises). "Dynamic diffracting trees." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/40614.

Der volle Inhalt der Quelle
Annotation:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.<br>Includes bibliographical references (p. 109-111).<br>by Giovanni M. Della-Libera.<br>M.Eng.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
21

Woznica, Hilary. "Hearts and Trees." VCU Scholars Compass, 2012. http://scholarscompass.vcu.edu/etd/306.

Der volle Inhalt der Quelle
Annotation:
The process of creating art is a visceral experience for me. Each piece is born from an inherent need to visually express and understand my experiences and emotions. I use a variety of materials to create mixed media sculptures, books, and two-dimensional images. Maps and trees are the common motifs and metaphors found in my work. I paint on the surface of maps to reference significant locations in my journey of personal growth. I incorporate found sticks and branches in my sculptures and paint images of trees to communicate my reverence for nature. I often use the tree as a symbol for m
APA, Harvard, Vancouver, ISO und andere Zitierweisen
22

Wright, Glenn C. "Irrigating Citrus Trees." College of Agriculture and Life Sciences, University of Arizona (Tucson, AZ), 2000. http://hdl.handle.net/10150/144778.

Der volle Inhalt der Quelle
Annotation:
5 pp.<br>Water is essential for citrus trees because it is an integral component of the biochemical reactions that occur within the plant, and also because it is the carrier that moves plant nutrients and other substances throughout the tree. This publication examines irrigating citrus trees. Topics include; water stress, estimating tree water use, timing water applications, dealing with salty water, calculating how much water is applied, as well as application methods and mulches. And it also includes a table which can be applied to spreadsheets, to calculate the exact amount of water a citru
APA, Harvard, Vancouver, ISO und andere Zitierweisen
23

Wright, Glenn C. "Budding Citrus Trees." College of Agriculture and Life Sciences, University of Arizona (Tucson, AZ), 2000. http://hdl.handle.net/10150/144814.

Der volle Inhalt der Quelle
Annotation:
3 pp.<br>Citrus budding is a plant propagation technique that any homeowner can do. Once the technique is learned, homeowners can add citrus tree. This publication addresses the budding techniques of citrus trees. Topics include the preparation prior to budding, selecting budsticks, storing budsticks, selecting and preparing the budding location, cutting the bud, inserting the bud in the t cut, and forcing the bud.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
24

Dawson, Shelly Jean. "Minimal congestion trees." CSUSB ScholarWorks, 2006. https://scholarworks.lib.csusb.edu/etd-project/3005.

Der volle Inhalt der Quelle
Annotation:
Analyzes the results of M.I. Ostrovskii's theorem of inequalities which estimate the minimal edge congestion for finite simple graphs. Uses the generic results of the theorem to examine and further reduce the parameters of inequalities for specific families of graphs, particularly complete graphs and complete bipartite graphs. Also, explores a possible minimal congestion tree for some grids while forming a conjecture for all grids.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
25

Goudjil, Amar. "Data structures, binary search trees, a study of random Weyl trees." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0026/MQ50778.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
26

Goudjil, Amar. "Data structures, binary search trees : a study of random Weyl trees." Thesis, McGill University, 1998. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=21559.

Der volle Inhalt der Quelle
Annotation:
This thesis covers the study of a particular class of binary search trees, the Weyl trees formed by consecutive insertion of numbers {theta}, {2theta}, {3theta}, ..., where theta is an irrational number from (0,1), and {x} denotes the fractional part of x. Various properties of the structure of these trees are explored and a relationship with the continued fraction expansion of theta is shown. Among these properties, an approximation of the height Hn of a Weyl tree with n nodes is given when theta is chosen at random and uniformly on (0, 1). The main result of this work is that in probability,
APA, Harvard, Vancouver, ISO und andere Zitierweisen
27

Holmgren, Cecilia. "Split Trees, Cuttings and Explosions." Doctoral thesis, Uppsala universitet, Matematiska institutionen, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-112239.

Der volle Inhalt der Quelle
Annotation:
This thesis is based on four papers investigating properties of split trees and also introducing new methods for studying such trees. Split trees comprise a large class of random trees of logarithmic height and include e.g., binary search trees, m-ary search trees, quadtrees, median of (2k+1)-trees, simplex trees, tries and digital search trees. Split trees are constructed recursively, using “split vectors”, to distribute n “balls” to the vertices/nodes. The vertices of a split tree may contain different numbers of balls; in computer science applications these balls often represent “key number
APA, Harvard, Vancouver, ISO und andere Zitierweisen
28

Kittle, T. Rene. "Influence of mycorrhizal inoculation treatments on native tree and shrub biomass and survival in a floodplain, Flathead Indian Reservation." CONNECT TO THIS TITLE ONLINE, 2007. http://etd.lib.umt.edu/theses/available/etd-06042007-104842/.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
29

Rathfon, Ronald A. "Developing DRIS norms for Fraser fir Christmas trees." Thesis, Virginia Tech, 1990. http://hdl.handle.net/10919/41610.

Der volle Inhalt der Quelle
Annotation:
Fraser fir [Abies fraseri (Pursh) Poir.] is an important Christmas tree species in Virginia. Because it is responsive to fertilization, and because most Fraser fir growers fertilize their crop, a scientifically-based nutrient diagnosis and fertilizer recommendation system is needed. The objective of this study was to develop and test DRIS norms for Fraser fir Christmas trees grown in Virginia for the ultimate purpose of establishing a nutrition diagnosis and fertilizer prescription system. A total of 107 Fraser fir plantations were sampled for foliage, soil, and diameter measurements. These pl
APA, Harvard, Vancouver, ISO und andere Zitierweisen
30

Riitters, Kurt H. "Analysis of Biweight Site Chronologies: Relative Weights of Individual Trees over Time." Tree-Ring Society, 1990. http://hdl.handle.net/10150/261911.

Der volle Inhalt der Quelle
Annotation:
The relative weights on individual trees in a biweight site chronology can indicate the consistency of tree growth responses to macroclimate and can be the basis for stratifying trees in climate-growth analyses. This was explored with 45 years of ring-width indices for 200 trees from five even-aged jack pine (Pints banksiana Lamb.) stands. Average individual-tree relative weights were similar, but most trees had at least one transient occurrence of low relative weight. The standard deviations of individual-tree relative weights suggested that some trees had mom variable growth responses than o
APA, Harvard, Vancouver, ISO und andere Zitierweisen
31

Biondi, Franco. "Development of a Tree-Ring Network for the Italian Peninsula." Tree-Ring Society, 1992. http://hdl.handle.net/10150/262358.

Der volle Inhalt der Quelle
Annotation:
This article describes the analysis of tree-ring collections from standing trees of sixteen species at twenty sites distributed throughout the Italian Peninsula. Visual and numerical crossdating among ring widths allowed the computation of standard and residual tree-ring chronologies. Relationships among chronologies were identified by Spearman's coefficient of rank correlation, using Bonferroni's inequality to adjust significance level. The oldest living tree sampled to date is a 963-year old palebark pine (Pinus leucodermis Ant.) at Parco del Pollino. Individuals more than two centuries old
APA, Harvard, Vancouver, ISO und andere Zitierweisen
32

Grissino-Mayer, Henri D. "An Updated List of Species Used in Tree-Ring Research." Tree-Ring Society, 1993. http://hdl.handle.net/10150/262378.

Der volle Inhalt der Quelle
Annotation:
During the past 100 years, researchers have investigated the potential of hundreds of tree and shrub species for use in applications of tree-ring research. Although several lists of species known to crossdate have been published, investigated species that do not crossdate are rarely included despite the usefulness of this information for future research. This paper provides a list of the Latin and common names of 573 species that have been investigated in tree-ring research, information on species known to crossdate, and information on species with measurement and/or chronology data in the Int
APA, Harvard, Vancouver, ISO und andere Zitierweisen
33

Thia, Joshua A. Y. W. "The plight of trees in disturbed forest: conservation of Montane Trees, Nigeria." Thesis, University of Canterbury. School of Biological Sciences, 2014. http://hdl.handle.net/10092/9887.

Der volle Inhalt der Quelle
Annotation:
The montane forests of Africa represent some of the Earth's most diverse and threatened ecosystems. In particular, those in West Africa have received comparatively little attention from scientists in terms of understanding the ecology and biodiversity of their species. This thesis wishes to understand genetic and ecological factors that underpin the long-term survival of selected tree species (Cordia millenii, Entandrophragma angolense, Lovoa trichilioides) in the montane forests of the Mambilla Plateau, Nigeria. The results obtained here provide a strong foundation for future work that wishes
APA, Harvard, Vancouver, ISO und andere Zitierweisen
34

Tadros, Alexandre. "Topological recursive fitting trees : A framework for interpretable regression extending decision trees." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-272130.

Der volle Inhalt der Quelle
Annotation:
Many real-world machine learning applications need interpretation of an algorithm output. The simplicity of some of the most fundamental machine learning algorithms for regression, such as linear regression or decision trees, facilitates interpretation. However, they fall short when facing complex (e.g. high-dimensional, nonlinear) relationships between variables. Several approaches like artificial neural networks and bagging or boosting variants of decision trees have been able to overcome this issue but at the cost of interpretation. We propose a framework called Topological Recursive Fittin
APA, Harvard, Vancouver, ISO und andere Zitierweisen
35

Yao, Chu. "Quad general tree drawing algorithm and general trees characterization : towards an environment for the experimental study on general tree drawing algorithms /." Full text available online, 2008. http://www.lib.rowan.edu/find/theses.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
36

MacKinnon, Richard Kyle. "Seeing the forest for the trees: tree-based uncertain frequent pattern mining." Springer International Publishing, 2014. http://hdl.handle.net/1993/31059.

Der volle Inhalt der Quelle
Annotation:
Many frequent pattern mining algorithms operate on precise data, where each data point is an exact accounting of a phenomena (e.g., I have exactly two sisters). Alas, reasoning this way is a simplification for many real world observations. Measurements, predictions, environmental factors, human error, &ct. all introduce a degree of uncertainty into the mix. Tree-based frequent pattern mining algorithms such as FP-growth are particularly efficient due to their compact in-memory representations of the input database, but their uncertain extensions can require many more tree nodes. I propose new
APA, Harvard, Vancouver, ISO und andere Zitierweisen
37

Horton, M. "Graceful Trees: Statistics and Algorithms." Thesis, Honours thesis, University of Tasmania, 2003. https://eprints.utas.edu.au/19/1/GracefulTreesStatisticsAndAlgorithms.pdf.

Der volle Inhalt der Quelle
Annotation:
The Graceful Tree Conjecture is a problem in graph theory that dates back to 1967. It suggests that every tree on n nodes can be labelled with the integers [1..n] such that the edges, when labelled with the difference between their endpoint node labels, are uniquely labelled with the integers [1..n-1]. To date, no proof or disproof of the conjecture has been found, but all trees with up to 28 vertices have been shown to be graceful. The conjecture also leads to a problem in algorithm design for efficiently finding graceful labellings for trees. In this thesis, a new graceful labelling algo
APA, Harvard, Vancouver, ISO und andere Zitierweisen
38

Kühn, Daniela. "Cycles, minors and trees." [S.l.] : [s.n.], 2001. http://www.sub.uni-hamburg.de/disse/511/kuehn.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
39

König, Bernhard. "Trees, games and reflections." [S.l.] : [s.n.], 2001. http://deposit.ddb.de/cgi-bin/dokserv?idn=964459620.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
40

Strothmann, Willy-B. "Bounded degree spanning trees /." Paderborn : HNI, 1997. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=007959737&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
41

König, Bernhard Andreas. "Trees, Games and Reflections." Diss., lmu, 2002. http://nbn-resolving.de/urn:nbn:de:bvb:19-81.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
42

Brumpton, Aaron M. W. "Molecules, trees, and guillotines." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ28178.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
43

Zamora, Cura Carlos Alberto. "Analysis of random trees." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0032/NQ64705.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
44

Cole, July Oskar. "Red Trees and Why." The University of Montana, 2010. http://etd.lib.umt.edu/theses/available/etd-06032010-203108/.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
45

Zhao, Rongyao. "Placements of euclidean trees." Thesis, McGill University, 1989. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74356.

Der volle Inhalt der Quelle
Annotation:
We define a Euclidean tree T = $(V,E)$ to be a weighted tree such that each edge $e in E$ has been assigned a positive integer weight l(e) called the length of e. A placement of T = $(V,E)$ is an assignment $f: V to { bf R} sp2$ (or R$ sp3$) of vertices to points in space satisfying the following: for each edge $e = (u,v) in E$, the Euclidean distance between f(u) and f(v) is equal to l(e). We define the EUCLIDEAN TREE PLACEMENT problem as follows. Given a Euclidean tree T = (V,E) and a subset of m vertices in V labeled $u sb1,u sb2, cdots,u sb{m}$, and given m nonempty sets $S sb1,S sb2, cdot
APA, Harvard, Vancouver, ISO und andere Zitierweisen
46

Collins, Karen L. (Karen Linda). "Distance matrices of trees." Thesis, Massachusetts Institute of Technology, 1986. http://hdl.handle.net/1721.1/77687.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
47

Pardi, Fabio. "Algorithms on phylogenetic trees." Thesis, University of Cambridge, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.611685.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
48

Razanajatovo, Misanantenaina Valisoa. "Properties of greedy trees." Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/95909.

Der volle Inhalt der Quelle
Annotation:
Thesis (MSc)--Stellenbosch University, 2014.<br>ENGLISH ABSTRACT: A greedy tree is constructed from a given degree sequence using a simple greedy algorithm that assigns the highest degree to the root, the second, the third, . . . , -highest degree to the root’s neighbours, etc. This particular tree is the solution to numerous extremal problems among all trees with given degree sequence. In this thesis, we collect results for some distancebased graph invariants, the number of subtrees and the spectral radius in which greedy trees play a major role. We show that greedy trees are extremal
APA, Harvard, Vancouver, ISO und andere Zitierweisen
49

Riveros, Jaeger Cristian. "Repairing strings and trees." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:012d384f-d1d0-471b-ae6e-bbf337892680.

Der volle Inhalt der Quelle
Annotation:
What do you do if a computational object fails a specification? An obvious approach is to repair it, namely, to modify the object minimally to get something that satisfies the constraints. In this thesis we study foundational problems of repairing regular specifications over strings and trees. Given two regular specifications R and T we aim to understand how difficult it is to transform an object satisfying R into an object satisfying T. The setting is motivated by considering R to be a restriction -- a constraint that the input object is guaranteed to satisfy -- while T is a target -- a const
APA, Harvard, Vancouver, ISO und andere Zitierweisen
50

Kemerling, Robert Alan. "Controlling with Model Trees." NSUWorks, 2011. http://nsuworks.nova.edu/gscis_etd/193.

Der volle Inhalt der Quelle
Annotation:
This dissertation develops a method of control for nonlinear processes based on regression trees with kernel regression at the leaves as a general control methodology. This methodology offers the ability to control a wide variety of processes exhibiting nonlinear behavior. It takes a place with other machine learning methods that are being applied to nonlinear control, but it does not suffer from the shortcomings of other methods. The method draws on two well-known machine learning methods, regression trees and kernel regression. This dissertation shows that this control method may be programm
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!