Relevant bibliographies by topics / Tree approach

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Tree approach'

Author: Grafiati
Published: 4 June 2021
Last updated: 12 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Tree approach.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Tree approach"

1

V, Aromal, Gokulnath G.L, and Geena Prasad. "Tree replanter: a solar powered approach." International Journal of Engineering & Technology 7, no. 4.5 (September 22, 2018): 678. http://dx.doi.org/10.14419/ijet.v7i4.5.25056.

Full text
Abstract:
Tree Transplantation is referred to as the procedure of unearthing the trees and replanting them from one location to another with the objective of re-growing the tree to a new location. This involves moving the tree with the root ball-system thereby protecting while tak-ing up the wider roots. In the proposed design, we use electromagnetic linear actuators working with solar energy instead of hydraulic or pneumatic actuators which consume fossil fuels. Here, a three-blade system is used to unearth the tree wherein the rare blades are opened to encircle the tree and the blades are positioned around the tree to ensure that the root ball is at an equal distance from all sides of the trunk. The blades are closed to remove the tree with the root ball intact. The tree with the spade is adjusted to the truck for safe transport.
APA, Harvard, Vancouver, ISO, and other styles
2

Tahernia, N. "Fuzzy-Logic Tree Approach for Seismic Hazard Analysis." International Journal of Engineering and Technology 6, no. 3 (2014): 182–85. http://dx.doi.org/10.7763/ijet.2014.v6.692.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Johnson, James E., Scott G. Lindow, and Robert Rogers. "An Approach to Assessing Competition in Young Red Pine Plantations." Northern Journal of Applied Forestry 12, no. 3 (September 1, 1995): 101–8. http://dx.doi.org/10.1093/njaf/12.3.101.

Full text
Abstract:
Abstract Several 5- and 6-yr-old red pine plantations in central Wisconsin were sampled to assess the performance of crop trees and the levels of competing vegetation. A simple tree class system was devised to classify the level of brush competition on a fixed area plot surrounding each sampled crop tree. The tree class was significantly correlated with several measured and derived competition variables, and was also strongly related with three tree performance variables: height, volume, and biomass. Tree Class 1, the lowest competition level, was associated with significantly greater tree heights, volumes, and biomasses for both age groups. Logistic regression equations were developed to derive a quantitative relationship between competition, as measured by tree class, and crop tree performance. Performance was judged to be either adequate or inadequate based on an arbitrary set of standards for both volume and biomass. From the regression equations, probabilities of successful performance were calculated. For volume index and biomass, the Class 1 trees, or the trees with the lowest levels of competition, had success probabilities ranging from 76 to 89%. For the Class 4 trees, or the trees with the highest levels of competition, success probabilities ranged from 3 to 16%. North. J. Appl. For. 12(3):101-108.
APA, Harvard, Vancouver, ISO, and other styles
4

Sohrabi, H. "Adaptive k-tree sample plot for the estimation of stem density: An empirical approach." Journal of Forest Science 64, No. 1 (January 29, 2018): 17–24. http://dx.doi.org/10.17221/111/2017-jfs.

Full text
Abstract:
Available budgets for the inventory of non-commercial woodlands are small. Therefore, there has been increased interest in using distance methods, such as k-tree sampling, which are faster than fixed plot sampling. In low-density woodlands, large search areas for k nearest trees contradict any practical advantage over sampling with fixed area plots. Here, a modification of a k-tree sample plot with an empirical approach to estimating the number of trees per unit area in low-density woodlands is presented. The standard and modified k-tree sample plots have been tested in one actual and three simulated forests with different spatial patterns. The modified method was superior to other combinations of methods in terms of relative bias and relative efficiency. Considering statistical and practical aspects of sampling for tree density, the modified method is more promising than is the standard one.
APA, Harvard, Vancouver, ISO, and other styles
5

RAHMANI, MOHSEN, SATTAR HASHEMI, ALI HAMZEH, and ASHKAN SAMI. "AGENT BASED DECISION TREE LEARNING: A NOVEL APPROACH." International Journal of Software Engineering and Knowledge Engineering 19, no. 07 (November 2009): 1015–22. http://dx.doi.org/10.1142/s0218194009004477.

Full text
Abstract:
Decision trees are one of the most effective and widely used induction methods that have received a great deal of attention over the past twenty years. When decision tree induction algorithms were used with uncertain rather than deterministic data, the result is a complete tree, which can classify most of the unseen samples correctly. This tree would be pruned in order to reduce its classification error and over-fitting. Recently, multi agent researchers concentrated on learning from large databases. In this paper we present a novel multi agent learning method that is able to induce a decision tree from distributed training sets. Our method is based on combination of separate decision trees each provided by one agent. Hence an agent is provided to aggregate results of the other agents and induces the final tree. Our empirical results suggest that the proposed method can provide significant benefits to distributed data classification.
APA, Harvard, Vancouver, ISO, and other styles
6

SCOVILLE, ADDISON B. "The Christmas Tree Approach." Southern Medical Journal 79, no. 8 (August 1986): 1009–10. http://dx.doi.org/10.1097/00007611-198608000-00022.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tria, Francesca, Emanuele Caglioti, Vittorio Loreto, and Andrea Pagnani. "A stochastic local search approach to language tree reconstruction." Diachronica 27, no. 2 (October 11, 2010): 341–58. http://dx.doi.org/10.1075/dia.27.2.09tri.

Full text
Abstract:
In this paper we introduce a novel stochastic local search algorithm to reconstruct phylogenetic trees. We focus in particular on the reconstruction of language trees based on the comparison of the Swadesh lists of the recently compiled ASJP database. Starting from a generic tree configuration, our scheme stochastically explores the space of possible trees driven by the minimization of a pseudo-functional quantifying the violations of additivity of the distance matrix. As a consequence the resulting tree can be annotated with the values of the violations on each internal branch. The values of the deviations are strongly correlated with the stability of the internal edges; they are measured with a novel bootstrap procedure and displayed on the tree as an additional annotation. As a case study we considered the reconstruction of the Indo-European language tree. The results are quite encouraging, highlighting a potential new avenue to investigate the role of the deviations from additivity and check the reliability and consistency of the reconstructed trees.
APA, Harvard, Vancouver, ISO, and other styles
8

Dr. S.Vijayarani, Dr S. Vijayarani, and M. Sangeetha M.Sangeetha. "A Novel Privacy Preserving Approach for Decision Tree Learning." Indian Journal of Applied Research 4, no. 3 (October 1, 2011): 136–39. http://dx.doi.org/10.15373/2249555x/mar2014/40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kumar, Sunil, Saroj Ratnoo, and Jyoti Vashishtha. "HYPER HEURISTIC EVOLUTIONARY APPROACH FOR CONSTRUCTING DECISION TREE CLASSIFIERS." Journal of Information and Communication Technology 20, Number 2 (February 21, 2021): 249–76. http://dx.doi.org/10.32890/jict2021.20.2.5.

Full text
Abstract:
Decision tree models have earned a special status in predictive modeling since these are considered comprehensible for human analysis and insight. Classification and Regression Tree (CART) algorithm is one of the renowned decision tree induction algorithms to address the classification as well as regression problems. Finding optimal values for the hyper parameters of a decision tree construction algorithm is a challenging issue. While making an effective decision tree classifier with high accuracy and comprehensibility, we need to address the question of setting optimal values for its hyper parameters like the maximum size of the tree, the minimum number of instances required in a node for inducing a split, node splitting criterion and the amount of pruning. The hyper parameter setting influences the performance of the decision tree model. As researchers, we know that no single setting of hyper parameters works equally well for different datasets. A particular setting that gives an optimal decision tree for one dataset may produce a sub-optimal decision tree model for another dataset. In this paper, we present a hyper heuristic approach for tuning the hyper parameters of Recursive and Partition Trees (rpart), which is a typical implementation of CART in statistical and data analytics package R. We employ an evolutionary algorithm as hyper heuristic for tuning the hyper parameters of the decision tree classifier. The approach is named as Hyper heuristic Evolutionary Approach with Recursive and Partition Trees (HEARpart). The proposed approach is validated on 30 datasets. It is statistically proved that HEARpart performs significantly better than WEKA’s J48 algorithm in terms of error rate, F-measure, and tree size. Further, the suggested hyper heuristic algorithm constructs significantly comprehensible models as compared to WEKA’s J48, CART and other similar decision tree construction strategies. The results show that the accuracy achieved by the hyper heuristic approach is slightly less as compared to the other comparative approaches.
APA, Harvard, Vancouver, ISO, and other styles
10

HEMMATI, SAHAR, BEHROUZ GATMIRI, YU-JUN CUI, and MARC VINCENT. "SOIL–VEGETATION–ATMOSPHERE INTERACTION BY A MULTIPHYSICS APPROACH." Journal of Multiscale Modelling 02, no. 03n04 (September 2010): 163–84. http://dx.doi.org/10.1142/s1756973710000382.

Full text
Abstract:
Ground settlement can damage light buildings supported by shallow foundations through cracking. The prediction and modeling of tree roots effect on soil water content and consequently the soil settlements needs a comprehensive analysis of the interactions between tree roots, soil, and water. Root water uptake by trees depends on soil conditions, climatic parameters, and vegetation type. A two-dimensional root-water-uptake model is implemented in a fully coupled thermo-hydro-mechanic finite element program, θ-STOCK. Evapotranspiration from the soil surface covered by grasses is calculated using energy balance and water balance on the surface of soil. The tree roots are modeled as sink terms which are distributed vertically for homogeneous canopy such as forests, or laterally in the case of single tree or a row of trees. The distribution of sink term depends of geometry of root zone and type of canopy. Two case studies are used for verification of implemented model by comparing the modeling results with the measured water content reduction in the zones influenced by tree roots. The soil settlements due to these water content reductions are also calculated.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Tree approach"

1

Simeone, Daniel. "Network connectivity: a tree decomposition approach." Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=18797.

Full text
Abstract:
We show that the gap between the least costly 3-edge-connected metric graph and the least costly 3-vertex-connected metric graph is at most $3$. The approach relies upon tree decompositions, and a degree limiting theorem of Bienstock et al. As well, we explore the tree decomposition approach for general k-edge and vertex-connected graphs, and demonstrate a large amount of the required background theory.
Nous démontrons que l'écart entre un graphe métrique 3-arête-connexe de coût minimum et un graphe métrique 3-sommet-connexe de coût minimum est au plus 3. Notre approche repose sur l'existence de décompositions arborescentes et sur un théorème de Bienstock et al qui limite les degrés des sommets. De plus, nous explorons la décomposition arborescente pour le cas plus général des graphes k-arête et sommet connexes et nous exposons en grande partie les résultats nécessaires pour accéder à notre travail.
APA, Harvard, Vancouver, ISO, and other styles
2

Hossain, Mohammad Forhad. "Spanning Tree Approach On The Snow Cleaning Problem." Thesis, Högskolan Dalarna, Datateknik, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847.

Full text
Abstract:
Snow cleaning is one of the important tasks in the winter time in Sweden. Every year government spends huge amount money for snow cleaning purpose. In this thesis we generate a shortest road network of the city and put the depots in different place of the city for snow cleaning. We generate shortest road network using minimum spanning tree algorithm and find the depots position using greedy heuristic. When snow is falling, vehicles start work from the depots and clean the snow all the road network of the city. We generate two types of model. Models are economic model and efficient model. Economic model provide good economical solution of the problem and it use less number of vehicles. Efficient model generate good efficient solution and it take less amount of time to clean the entire road network.
APA, Harvard, Vancouver, ISO, and other styles
3

Zhao, Boning. "A THEORETIC APPROACH FOR BINARY GAME TREE EVALUATION." Case Western Reserve University School of Graduate Studies / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=case1586520140611046.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gramsci, Shantanu Khan. "A scalable video streaming approach using distributed b-tree." Thesis, University of British Columbia, 2011. http://hdl.handle.net/2429/33848.

Full text
Abstract:
Streaming video comprises the most of today’s Internet traffic, and it’s pre- dicted to increase more. Today millions of users are watching video over the Internet; video sharing sites are getting more than billion hits per day. To serve this massive user base has always been a challenging job. Over the period of time a number of approaches have been proposed, mainly in two categories - client server and peer to peer based streaming. Despite the potential scalability benefits of peer to peer systems, most popular video sharing sites today are using client server model, leveraging the caching benefits of Content Delivery Networks. In such scenarios, video files are replicated among a group of edge servers, clients’ requests are directed to an edge server instead of serving by the original video source server. The main bottle neck to this approach is that each server has a capacity limit beyond which it cannot serve properly. Instead of traditional file based streaming approach, in this thesis we pro- pose to use distributed data structure as the underlying storage for streaming video. We developed a distributed B-tree, and stored video files in the B- tree which runs over a cluster of computers and served from there. We show that system throughput increases almost linearly when more computers are added to the system.
APA, Harvard, Vancouver, ISO, and other styles
5

Nigh, Gordon Donald. "A process oriented approach to modelling forest tree mortality /." Toronto, 1994. http://opac.nebis.ch/cgi-bin/showAbstract.pl?u20=0315927828.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tomek, Michal. "A stochastic tree approach to pricing multidimensional American options." Thesis, Imperial College London, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.429210.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Liu, Lu. "Pricing energy path-dependent option using tree based approach." Thesis, Imperial College London, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.512006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

SOBRAL, ANA PAULA BARBOSA. "HOURLY LOAD FORECASTING A NEW APPROACH THROUGH DECISION TREE." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2003. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=3710@1.

Full text
Abstract:
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
A importância da previsão de carga a curto prazo (até uma semana à frente) em crescido recentemente. Com os processos de privatização e implantação de ompetição no setor elétrico brasileiro, a previsão de tarifas de energia vai se tornar extremamente importante. As previsões das cargas elétricas são fundamentais para alimentar as ferramentas analíticas utilizadas na sinalização das tarifas. Em conseqüência destas mudanças estruturais no setor, a variabilidade e a não-estacionaridade das cargas elétricas tendem a aumentar devido à dinâmica dos preços da energia. Em função das mudanças estruturais do setor elétrico, previsores mais autônomos são necessários para o novo cenário que se aproxima. As ferramentas disponíveis no mercado internacional para previsão de carga elétrica requerem uma quantidade significativa de informações on-line, principalmente no que se refere a dados meteorológicos. Como a realidade brasileira ainda não permite o acesso a essas informações será proposto um previsor de carga para o curto-prazo, considerando restrições na aquisição dos dados de temperatura. Logo, tem-se como proposta um modelo de previsão de carga horária de curto prazo (um dia a frente) empregando dados de carga elétrica e dados meteorológicos (temperatura) através de modelos de árvore de decisão. Decidiu-se pelo modelo de árvore de decisão, pois este modelo além de apresentar uma grande facilidade de interpretação dos resultados, apresenta pouquíssima ênfase em sua utilização na área de previsão de carga elétrica.
The importance of load forecasting for the short term (up to one-week ahead) has been steadily growing in the last years. Load forecasts are the basis for the forecasting of energy prices, and the privatisation, and the introduction of competitiveness in the Brazilian electricity sector, have turned price forecasting into an extremely important task. As a consequence of structural changes in the electricity sector, the variability and the non-stationarity of the electrical loads have tended to increase, because of the dynamics of the energy prices. As a consequence of these structural changes, new forecasting methods are needed to meet the new scenarios. The tools that are available for load forecasting in the international market require a large amount of online information, specially information about weather data. Since this information is not yet readily available in Brazil, this thesis proposes a short-term load forecaster that takes into consideration the restrictions in the acquisition of temperature data. A short-term (one-day ahead) forecaster of hourly loads is proposed that combines load data and weather data (temperature), by means of decision tree models. Decision trees were chosen because those models, despite being easy to interpret, have been very rarely used for load forecasting.
APA, Harvard, Vancouver, ISO, and other styles
9

Alnatsheh, Rami H. "Frequent Itemset Hiding Algorithm Using Frequent Pattern Tree Approach." NSUWorks, 2012. http://nsuworks.nova.edu/gscis_etd/76.

Full text
Abstract:
A problem that has been the focus of much recent research in privacy preserving data-mining is the frequent itemset hiding (FIH) problem. Identifying itemsets that appear together frequently in customer transactions is a common task in association rule mining. Organizations that share data with business partners may consider some of the frequent itemsets sensitive and aim to hide such sensitive itemsets by removing items from certain transactions. Since such modifications adversely affect the utility of the database for data mining applications, the goal is to remove as few items as possible. Since the frequent itemset hiding problem is NP-hard and practical instances of this problem are too large to be solved optimally, there is a need for heuristic methods that provide good solutions. This dissertation developed a new method called Min_Items_Removed, using the Frequent Pattern Tree (FP-Tree) that outperforms extant methods for the FIH problem. The FP-Tree enables the compression of large databases into significantly smaller data structures. As a result of this compression, a search may be performed with increased speed and efficiency. To evaluate the effectiveness and performance of the Min_Items_Removed algorithm, eight experiments were conducted. The results showed that the Min_Items_Removed algorithm yields better quality solutions than extant methods in terms of minimizing the number of removed items. In addition, the results showed that the newly introduced metric (normalized number of leaves) is a very good indicator of the problem size or difficulty of the problem instance that is independent of the number of sensitive itemsets.
APA, Harvard, Vancouver, ISO, and other styles
10

Villori, Narasiman C. "Distributed degree-constrained application-level multicast tree a partitioning approach /." Cincinnati, Ohio : University of Cincinnati, 2008. http://rave.ohiolink.edu/etdc/view.cgi?acc_num=ucin1205964934.

Full text
Abstract:
Thesis (M.S.)--University of Cincinnati, 2008.
Advisor: Fred Annexstein . Title from electronic thesis title page (viewed Oct.23, 2008). Includes abstract. Keywords: Degree-constrained; Multicast; spanning tree; partitioning. Includes bibliographical references.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Tree approach"

1

Association, American Bankers. Analyzing financial statements: A decision tree approach. Washington, D.C: American Bankers Association, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Grimble, R. J. Tree resources and environmental policy: A stakeholder approach. Chatham, UK: Natural Resources Institute, Overseas Development Administration, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Medical conditions and massage therapy: A decision tree approach. Philadelphia: Wolters Kluwer/Lippincott Williams & Wilkins Health, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Noda, Iwao, Tosporn Vacharangkura, and Woraphun Himmapan. Approach to sustainable forestry of indigenous tree species in Northeast Thailand. Tsukuba, Ibaraki, Japan: Japan International Research Center for Agricultural Sciences, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Needham, Donald Michael. A formal approach to hazard decomposition in Software Fault Tree Analysis. Monterey, California: Naval Postgraduate School, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

The crystal tree: A structured approach to reading crystals and colored stones. West Chester, Pa., USA: Whitford Press, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kramer, Bradley J. Beholding the tree of life: A rabbinic approach to the Book of Mormon. Salt Lake City: Greg Kofford Books, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Green Belt Movement (Society : Kenya), ed. The Green Belt Movement: Sharing the approach and the experience. New York: Lantern Books, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Maathai, Wangari. The Green Belt Movement: Sharing the approach and the experience. Nairobi, Kenya: Environment Liaison Centre International, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gougeon, François A. Forest information extraction from high spatial resolution images using an individual tree crown approach. Victoria: Natural Resources Canada, Canadian Forest Service, Pacific Forestry Centre, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Tree approach"

1

Goodwin, Duncan. "An integrated approach to green infrastructure." In The Urban Tree, 225–42. Abingdon, Oxon; New York, NY : Rochester, 2017.: Routledge, 2017. http://dx.doi.org/10.4324/9781315266169-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Elwood, Patricia Anne. "The tree drawing." In A Jungian Approach to Spontaneous Drawing, 129–43. Abingdon, Oxon ; New York, NY : Routledge, 2020.: Routledge, 2019. http://dx.doi.org/10.4324/9780429264535-12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kozak, Jan. "Ant Colony Decision Tree Approach." In Studies in Computational Intelligence, 45–80. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-93752-6_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhou, Yatong, Taiyi Zhang, and Zhigang Chen. "Applying Bayesian Approach to Decision Tree." In Lecture Notes in Computer Science, 290–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/978-3-540-37275-2_37.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Breidenbach, Johannes, and Rasmus Astrup. "The Semi-Individual Tree Crown Approach." In Forestry Applications of Airborne Laser Scanning, 113–33. Dordrecht: Springer Netherlands, 2013. http://dx.doi.org/10.1007/978-94-017-8663-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rao, K. Durga, V. V. S. Sanyasi Rao, A. K. Verma, and A. Srividya. "Dynamic Fault Tree Analysis: Simulation Approach." In Springer Series in Reliability Engineering, 41–64. London: Springer London, 2010. http://dx.doi.org/10.1007/978-1-84882-213-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Rauh, Otto, and Eberhard Stickel. "Entity tree clustering — A method for simplifying ER designs." In Entity-Relationship Approach — ER '92, 62–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56023-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Šlibar, Barbara. "Modeling Open Data Usage: Decision Tree Approach." In Advances in Intelligent Systems and Computing, 57–64. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-1286-5_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lee, Cheng-Few, John Lee, Jow-Ran Chang, and Tzu Tai. "Binomial Option Pricing Model Decision Tree Approach." In Essentials of Excel, Excel VBA, SAS and Minitab for Statistical and Financial Analyses, 801–34. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-38867-0_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zieliński, Bartłomiej, and Marcin Iwanowski. "Comparing Image Objects Using Tree-Based Approach." In Computer Vision and Graphics, 702–9. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33564-8_84.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Tree approach"

1

Chen, Li, Rupesh Choubey, and Elke A. Rundensteiner. "Bulk-insertions info r-trees using the small-tree-large-tree approach." In the sixth ACM international symposium. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/288692.288722.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Nunes, Cecilia, Mathieu De Craene, Helene Langet, Oscar Camara, and Anders Jonsson. "A Monte Carlo Tree Search Approach to Learning Decision Trees." In 2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA). IEEE, 2018. http://dx.doi.org/10.1109/icmla.2018.00070.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Karapinar, Zehra, Arafat Senturk, Sultan Zavrak, Resul Kara, and Pakize Erdogmus. "Binary apple tree: A game approach to tree traversal algorithms." In 2012 11th International Conference on Information Technology Based Higher Education and Training (ITHET). IEEE, 2012. http://dx.doi.org/10.1109/ithet.2012.6246026.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Guo, Xin, Yun Li, Yunhao Yuan, Jia Wu, and Ling Chen. "A Novel Tree Cluster Approach Based on Least Closed Tree." In 2009 International Conference on Artificial Intelligence and Computational Intelligence. IEEE, 2009. http://dx.doi.org/10.1109/aici.2009.314.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pan, T. S., and S. S. Rao. "Fault Tree Approach for the Reliability Analysis of Gear Trains: Part I — Basic Theory." In ASME 1987 Design Technology Conferences. American Society of Mechanical Engineers, 1987. http://dx.doi.org/10.1115/detc1987-0035.

Full text
Abstract:
Abstract The application of fault tree techniques to the analysis of gear trains is considered. The techniques involve the decomposition of the system into a logic diagram or fault tree in which certain basic or primary events lead to a specified top event which signifies the total failure of the system. The fault trees are used to obtain minimal cut sets from which the modes of system failure and, hence, the reliability measure for the top event can be calculated. The method of constructing fault trees and the subsequent estimation of reliability of the system is illustrated through a nine speed compound gear train and a five speed epicyclic gear train.
APA, Harvard, Vancouver, ISO, and other styles
6

Pan, T. S., and S. S. Rao. "Fault Tree Approach for the Reliability Analysis of Gear Trains: Part II — Example Applications." In ASME 1987 Design Technology Conferences. American Society of Mechanical Engineers, 1987. http://dx.doi.org/10.1115/detc1987-0036.

Full text
Abstract:
Abstract The application of fault tree techniques to the analysis of gear trains is considered. The techniques involve the decomposition of the system into a logic diagram or fault tree in which certain basic or primary events lead to a specified top event which signifies the total failure of the system. The fault trees are used to obtain minimal cut sets from which the modes of system failure and hence the reliability measure for the top event can be calculated. The method of constructing fault trees and the subsequent estimation of reliability of the system is illustrated through a nine speed compound gear train and a five speed epicyclic gear train.
APA, Harvard, Vancouver, ISO, and other styles
7

Fernique, Pierre, Anaeile Dambreville, Jean-Baptiste Durand, Christophe Pradal, Pierre-Eric Lauri, Frederic Normand, and Yann Guedon. "Characterization of mango tree patchiness using a tree-segmentation/clustering approach." In 2016 IEEE International Conference on Functional-Structural Plant Growth Modeling, Simulation, Visualization and Applications (FSPMA). IEEE, 2016. http://dx.doi.org/10.1109/fspma.2016.7818290.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Thomas, Mini S., and Parveen Poon Terang. "Islanding detection using decision tree approach." In 2010 Power India. IEEE, 2010. http://dx.doi.org/10.1109/pedes.2010.5712394.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Renugadevi, V. "An approach to solar power tree." In 2017 IEEE International Conference on Electrical, Instrumentation and Communication Engineering (ICEICE). IEEE, 2017. http://dx.doi.org/10.1109/iceice.2017.8191921.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

"BRANCHES FILTERING APPROACH FOR MAX-TREE." In International Conference on Computer Vision Theory and Applications. SciTePress - Science and and Technology Publications, 2007. http://dx.doi.org/10.5220/0002059203280332.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Tree approach"

1

Andrea Alfonsi, Cristian Rabiti, Diego Mandelli, Joshua Cogliati, and Robert Kinoshita. RAVEN: Dynamic Event Tree Approach Level III Milestone. Office of Scientific and Technical Information (OSTI), July 2013. http://dx.doi.org/10.2172/1111510.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Liu, Lifeng, and Stan Sclaroff. Retrieval by Shape Population: An Index Tree Approach. Fort Belvoir, VA: Defense Technical Information Center, June 2001. http://dx.doi.org/10.21236/ada443225.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Alfonsi, Andrea, Cristian Rabiti, Diego Mandelli, Joshua Cogliati, and Robert Kinoshita. RAVEN. Dynamic Event Tree Approach Level III Milestone. Office of Scientific and Technical Information (OSTI), July 2014. http://dx.doi.org/10.2172/1182224.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ramineni, Narahari. Tree Restructuring Approach to Mapping Problem in Cellular Architecture FPGAS. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.6790.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chin, Seungwoo, Matthew Kahn, and Hyungsik Roger Moon. Estimating the Gains from New Rail Transit Investment: A Machine Learning Tree Approach. Cambridge, MA: National Bureau of Economic Research, April 2017. http://dx.doi.org/10.3386/w23326.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Huang, Ran, Songyee Hur, and Sejin Ha. Mapping Consumer Engagement and Brand Impression Management in Instagram: A Decision Tree Approach. Ames: Iowa State University, Digital Repository, November 2016. http://dx.doi.org/10.31274/itaa_proceedings-180814-1495.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Petrova, Slaveya, Iliana Velcheva, Bogdan Nikolov, Plamen Marinov-Serafimov, Irena Golubinova, Vladislav Popov, Ekaterina Valcheva, and Kostadinka Todorova. Assessment of the Adaptation of Some Tree Species to the Urban Environment in Bulgaria – a Model Approach. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, December 2019. http://dx.doi.org/10.7546/crabs.2019.12.11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kimbrough, J. R., N. J. Colella, R. W. Davis, D. B. Bruener, P. G. Coakley, S. W. Lutjens, and C. E. Mallon. Single event and TREE latchup mitigation for a star tracker sensor: An innovative approach to system level latchup mitigation. Office of Scientific and Technical Information (OSTI), August 1994. http://dx.doi.org/10.2172/46731.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kindt, Roeland, Ian K Dawson, Jens-Peter B Lillesø, Alice Muchugi, Fabio Pedercini, and James M Roshetko. The one hundred tree species prioritized for planting in the tropics and subtropics as indicated by database mining. World Agroforestry, 2021. http://dx.doi.org/10.5716/wp21001.pdf.

Full text
Abstract:
A systematic approach to tree planting and management globally is hindered by the limited synthesis of information sources on tree uses and species priorities. To help address this, the authors ‘mined’ information from 23 online global and regional databases to assemble a list of the most frequent tree species deemed useful for planting according to database mentions, with a focus on tropical regions. Using a simple vote count approach for ranking species, we obtained a shortlist of 100 trees mentioned in at least 10 of our data sources (the ‘top-100’ species). A longer list of 830 trees that were mentioned at least five times was also compiled. Our ‘top-100’ list indicated that the family Fabaceae (syn. Leguminosae) was most common. The information associated with our mined data sources indicated that the ‘top-100’ list consisted of a complementary group of species of differing uses. These included the following: for wood (mostly for timber) and fuel production, human nutrition, animal fodder supply, and environmental service provision (varied services). Of these uses, wood was most frequently specified, with fuel and food use also highly important. Many of the ‘top-100’ species were assigned multiple uses. The majority of the ‘top-100’ species had weediness characteristics according to ‘attribute’ invasiveness databases that were also reviewed, thereby demonstrating potential environmental concerns associated with tree planting that need to be balanced against environmental and livelihood benefits. Less than half of the ‘top-100’ species were included in the OECD Scheme for the Certification of Forest Reproductive Material, thus supporting a view that lack of germplasm access is a common concern for trees. A comparison of the ‘top-100’ species with regionally-defined tree inventories indicated their diverse continental origins, as would be anticipated from a global analysis. However, compared to baseline expectations, some geographic regions were better represented than others. Our analysis assists in priority-setting for research and serves as a guide to practical tree planting initiatives. We stress that this ‘top-100’ list does not necessarily represent tree priorities for the future, but provides a starting point for also addressing representation gaps. Indeed, our primary concern going forward is with the latter.
APA, Harvard, Vancouver, ISO, and other styles
10

Roman, Lara A., John J. Battles, and Joe R. McBride. Urban tree mortality: a primer on demographic approaches. Newtown Square, PA: U.S. Department of Agriculture, Forest Service, Northern Research Station, 2016. http://dx.doi.org/10.2737/nrs-gtr-158.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Tree approach' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography