Relevant bibliographies by topics / March algorithms

Contents

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

Academic literature on the topic 'March algorithms'

Author: Grafiati
Published: 4 June 2021
Last updated: 3 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 'March algorithms.'

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 "March algorithms"

1

Tobing, Fenina Adline Twince, and Prayogo . "Perbandingan Algoritma Convex Hull: Jarvis March dan Graham Scan." Ultimatics : Jurnal Teknik Informatika 12, no. 2 (2020): 114–17. http://dx.doi.org/10.31937/ti.v12i2.1800.

Full text
Abstract:
Comparison of algorithms is needed to determine the level of efficiency of an algorithm. The existence of a speed comparison in an algorithm that will make a unique shape is sometimes a problem that must be solved by comparing one algorithm with another. This problem can be solved by using Jarvis March and Graham Scan where this algorithm will create a unique shape of a point followed by testing the speed comparison of the two algorithms and the result can be stated that the Graham Scan algorithm in general works faster than the algorithm Jarvis March.
APA, Harvard, Vancouver, ISO, and other styles
2

Praneeth, B. V. S. Sai. "Finite State Machine based Programmable Memory Built-in Self-Test." International Journal for Research in Applied Science and Engineering Technology 9, no. VI (2021): 3805–9. http://dx.doi.org/10.22214/ijraset.2021.35875.

Full text
Abstract:
We propose a methodology to design a Finite State Machine(FSM)-based Programmable Memory Built-In Self Test (PMBIST) which includes a planned procedure for Memory BIST which has a controller to select a test algorithm from a fixed set of algorithms that are built in the memory BIST. In general, it is not possible to test all the different memory modules present in System-on-Chip (SoC) with a single Test algorithm. Subsequently it is desirable to have a programmable Memory BIST controller which can execute multiple test algorithms. The proposed Memory BIST controller is designed as a FSM (Finit
APA, Harvard, Vancouver, ISO, and other styles
3

Sungju, Park, Youn Donkyu, Kim Taehyung, et al. "Microcode-Based Memory BIST Implementing Modified March Algorithms." Journal of the Korean Physical Society 40, no. 4 (2002): 749. http://dx.doi.org/10.3938/jkps.40.749.

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

Berchtold, André, Ogier Maitre, and Kevin Emery. "Optimization of the Mixture Transition Distribution Model Using the March Package for R." Symmetry 12, no. 12 (2020): 2031. http://dx.doi.org/10.3390/sym12122031.

Full text
Abstract:
Optimization of mixture models such as the mixture transition distribution (MTD) model is notoriously difficult because of the high complexity of their solution space. The best approach comprises combining features of two types of algorithms: an algorithm that can explore as completely as possible the whole solution space (e.g., an evolutionary algorithm), and another that can quickly identify an optimum starting from a set of initial conditions (for instance, an EM algorithm). The march package for the R environment is a library dedicated to the computation of Markovian models for categorical
APA, Harvard, Vancouver, ISO, and other styles
5

Van De Goor, AD J., and Yervant Zorian. "Effective march algorithms for testing single-order addressed memories." Journal of Electronic Testing 5, no. 4 (1994): 337–45. http://dx.doi.org/10.1007/bf00972518.

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

Vyšniauskaitė, Laura, and Vydūnas Šaltenis. "A PRIORI FILTRATION OF POINTS FOR FINDING CONVEX HULL." Technological and Economic Development of Economy 12, no. 4 (2006): 341–46. http://dx.doi.org/10.3846/13928619.2006.9637764.

Full text
Abstract:
Convex hull is the minimum area convex polygon containing the planar set. By now there are quite many convex hull algorithms (Graham Scan, Jarvis March, QuickHull, Incremental, Divide‐and‐Conquer, Marriage‐before‐Conquest, Monotone Chain, Brute Force). The main attention while choosing the algorithm is paid to the running time. In order to raise the efficiency of all the algorithms an idea of a priori filtration of points is given in this article. Besides, two new algorithms have been created and presented. The experiment research has shown a very good efficiency of these algorithms.
APA, Harvard, Vancouver, ISO, and other styles
7

Yarmolik, V. N., I. Mrozek, and S. V. Yarmolik. "Pseudoexhaustive memory testing based on March A type march tests." Informatics 17, no. 2 (2020): 54–70. http://dx.doi.org/10.37661/1816-0301-2020-17-2-54-70.

Full text
Abstract:
The relevance of testing of memory devices of modern computing systems is shown. The methods and algorithms for implementing test procedures based on classical March tests are analyzed. Multiple March tests are highlighted to detect complex pattern-sensitive memory faults. To detect them, the necessary condition that test procedures must satisfy to deal complex faults, is substantiated. This condition is in the formation of a pseudo-exhaustive test for a given number of arbitrary memory cells. We study the effectiveness of single and double application of tests like MATS ++, March C– and March
APA, Harvard, Vancouver, ISO, and other styles
8

Wei Chun, Quek, Pang Wai Leong, Chan Kah Yoong, Lee It Ee, and Chung Gwo Chin. "HDL Modelling of Low-CostMemory Fault Detection Tester." Journal of Engineering Technology and Applied Physics 2, no. 2 (2020): 17–23. http://dx.doi.org/10.33093/jetap.2020.2.2.3.

Full text
Abstract:
Memory modules are widely used in varies kind of electronics system design. The capacity of the memory modules has increased rapidly since the past few years in order to satisfy the high demand from the end-users. The memory modules’ manufacturers demand more units of automatic test equipment (ATE)to increase the production rate. However, the existing ATE used in the industry to carry out the memory testing is too costly(at least a million dollars per ATE tester). The low-cost memory testers are urgently needed to increase the production rate of the memory module. This has in spired us to desi
APA, Harvard, Vancouver, ISO, and other styles
9

Lin, Zhiting, Chunyu Peng, and Kun Wang. "A Novel Controllable BIST Circuit for embedded SRAM." Open Electrical & Electronic Engineering Journal 10, no. 1 (2016): 1–10. http://dx.doi.org/10.2174/1874129001610010001.

Full text
Abstract:
With increasingly stringent requirements for memory test, the complexity of the test algorithm is increasing. This will make BIST (Build-In-Self-Test) circuit more complex and the area of BIST circuit larger. This paper proposes a novel controllable BIST circuit. The controllable BIST circuit provides a cost-effective solution that supports a variety of March algorithms and SRAM embedded testing operation modes. It controls the test patterns with three additional input ports. And it indicates the algorithm progress, the test result and the number of fails with three output ports. To achieve te
APA, Harvard, Vancouver, ISO, and other styles
10

Singh, Balwinder, Arun Khosla, and Sukhleen Bindra Narang. "Area Overhead and Power Analysis of March Algorithms for Memory BIST." Procedia Engineering 30 (2012): 930–36. http://dx.doi.org/10.1016/j.proeng.2012.01.947.

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

Dissertations / Theses on the topic "March algorithms"

1

Vykydal, Lukáš. "Mikroprogramem řízený RAM BIST." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2017. http://www.nusl.cz/ntk/nusl-316440.

Full text
Abstract:
The goal of this work is to understand types of defects in semiconductor memories and algorithms for their testing. In the second part the work describes design and implementation of programmable BIST controller with small digital block size requirments.
APA, Harvard, Vancouver, ISO, and other styles
2

Goerigk, Marc [Verfasser], Anita [Akademischer Betreuer] Schöbel, and Marco [Akademischer Betreuer] Lübbecke. "Algorithms and Concepts for Robust Optimization / Marc Goerigk. Gutachter: Anita Schöbel ; Marco Lübbecke. Betreuer: Anita Schöbel." Göttingen : Niedersächsische Staats- und Universitätsbibliothek Göttingen, 2013. http://d-nb.info/104404764X/34.

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

Huber, Marco [Verfasser]. "Nonlinear Gaussian Filtering : Theory, Algorithms, and Applications / Marco Huber." Karlsruhe : KIT-Bibliothek, 2015. http://d-nb.info/1068263369/34.

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

Bender, Marco [Verfasser]. "Randomized Approximation and Online Algorithms for Assignment Problems / Marco Bender." München : Verlag Dr. Hut, 2015. http://d-nb.info/1074063333/34.

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

Laumanns, Marco [Verfasser]. "Analysis and Applications of Evolutionary Multiobjective Optimization Algorithms / Marco Laumanns." Aachen : Shaker, 2003. http://d-nb.info/1170542379/34.

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

Infante, Acevedo José Arturo. "Méthodes et modèles numériques appliqués aux risques du marché et à l’évaluation financière." Thesis, Paris Est, 2013. http://www.theses.fr/2013PEST1086/document.

Full text
Abstract:
Ce travail de thèse aborde deux sujets : (i) L'utilisation d'une nouvelle méthode numérique pour l'évaluation des options sur un panier d'actifs, (ii) Le risque de liquidité, la modélisation du carnet d'ordres et la microstructure de marché. Premier thème : Un algorithme glouton et ses applications pour résoudre des équations aux dérivées partielles. L'exemple typique en finance est l'évaluation d'une option sur un panier d'actifs, laquelle peut être obtenue en résolvant l'EDP de Black-Scholes ayant comme dimension le nombre d'actifs considérés. Nous proposons d'étudier un algorithme qui a été
APA, Harvard, Vancouver, ISO, and other styles
7

Huber, Marco [Verfasser]. "Nonlinear Gaussian Filtering : Theory, Algorithms, and Applications [[Elektronische Ressource]] / Marco Huber." Karlsruhe : KIT Scientific Publishing, 2015. http://nbn-resolving.de/urn:nbn:de:0072-454914.

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

Kibriya, Ashraf Masood. "Fast Algorithms for Nearest Neighbour Search." The University of Waikato, 2007. http://hdl.handle.net/10289/2463.

Full text
Abstract:
The nearest neighbour problem is of practical significance in a number of fields. Often we are interested in finding an object near to a given query object. The problem is old, and a large number of solutions have been proposed for it in the literature. However, it remains the case that even the most popular of the techniques proposed for its solution have not been compared against each other. Also, many techniques, including the old and popular ones, can be implemented in a number of ways, and often the different implementations of a technique have not been thoroughly compared either. This
APA, Harvard, Vancouver, ISO, and other styles
9

Gomes, Marciel Alberto. "Algoritmos de adaptação do padrão de marcha utilizando redes neurais." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/18/18149/tde-11112009-164840/.

Full text
Abstract:
Este trabalho apresenta o desenvolvimento de algoritmos de adaptação do padrão de marcha com a utilização de redes neurais artificiais para uma órtese ativa para membros inferiores. Trajetórias estáveis são geradas durante o processo de otimização, considerando um gerador de trajetórias baseado no critério do ZMP (Zero Moment Point) e no modelo dinâmico do equipamento. Três redes neurais são usadas para diminuir o tempo de cálculo do modelo e da otimização do ZMP, e reproduzir o gerador de trajetórias analítico. A primeira rede aproxima a dinâmica do modelo fornecendo a variação de torque nece
APA, Harvard, Vancouver, ISO, and other styles
10

Fehling, Marc [Verfasser]. "Algorithms for massively parallel generic hp-adaptive finite element methods / Marc Fehling." Wuppertal : Universitätsbibliothek Wuppertal, 2020. http://d-nb.info/121766842X/34.

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

Books on the topic "March algorithms"

1

IEE Seminar on Target Tracking: Algorithms and Applications (2006 Birmingham, England). The IEE seminar on target tracking: algorithms and applications: 7-8 March 2006. Institution of Electrical Engineers, 2006.

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

Giancarlo, Bongiovanni, Gambosi G. 1955-, and Petreschi Rossella 1950-, eds. Algorithms and complexity: 4th Italian conference, CIAC 2000, Rome, Italy, March 2000 : proceedings. Springer, 2000.

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

Society of Photo-optical Instrumentation Engineers, ed. Algorithms for synthetic aperture radar imagery XV: 17-18 March 2008, Orlando, Florida, USA. SPIE, 2008.

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

Giancarlo, Bongiovanni, Bovet Daniel P, and Di Battista Giuseppe, eds. Algorithms and complexity: Third Italian conference, CIAC '97, Rome, Italy, March 12-14, 1997 : proceedings. Springer, 1997.

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

Pogue, C. A. Text searching algorithms for parallel processors: Final report for the period October 1984 to March 1986. Dept of Information Studies, Univ. Sheffield, 1986.

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

Blowers, Misty. Evolutionary and bio-inspired computation: Theory and applications II : 17-18 March 2008, Orlando, Florida, USA. SPIE, 2008.

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

International Conference on Computing: Theory and Applications (2007 Kolkata, India). ICCTA 2007: Proceedings : International Conference on Computing: Theory and Applications : 5-7 March, 2007, Kolkata, India. IEEE Computer Society, 2007.

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

Shen, Sylvia S. Algorithms and technologies for multispectral, hyperspectral, and ultraspectral imagery XIV: 17-19 March 2008, Orlando, Florida, USA. SPIE, 2008.

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

Society of Photo-optical Instrumentation Engineers, ed. Algorithms and technologies for multispectral, hyperspectral, and ultraspectral imagery XIV: 17-19 March 2008, Orlando, Florida, USA. SPIE, 2008.

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

Albrecht, Hübler, ed. Geobild '89: Proceedings of the 4th Workshop on Geometrical Problems of Image Processing, held in Georgenthal (GDR), March 13-17, 1989. Akademie-Verlag, 1989.

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

Book chapters on the topic "March algorithms"

1

Yarmolik, V. N., I. V. Bykov, S. Hellebrand, and H. J. Wunderlich. "Transparent Word-Oriented Memory BIST Based on Symmetric March Algorithms." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48254-7_23.

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

Kranakis, Evangelos, and Paul M. B. Vitányi. "Weighted distributed match-making." In VLSI Algorithms and Architectures. Springer New York, 1988. http://dx.doi.org/10.1007/bfb0040403.

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

Schaller, David, Manuela Geiß, Marc Hellmuth, and Peter F. Stadler. "Best Match Graphs with Binary Trees." In Algorithms for Computational Biology. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-74432-8_6.

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

Hughes, Ciaran, Joshua Isaacson, Anastasia Perry, Ranbel F. Sun, and Jessica Turner. "Quantum Algorithms." In Quantum Computing for the Quantum Curious. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61601-4_9.

Full text
Abstract:
AbstractWe have come a long way from Chap. 10.1007/978-3-030-61601-4_1 To recap on what we have learnt, we have understood important quantum mechanical phenomena such as superposition and measurement (through the Stern-Gerlach and Mach-Zehnder experiments). We have also learnt that while quantum computers can in principle break classical encryption protocols, they can also be used to make new secure channels of communication. Furthermore, we have applied quantum logic gates to qubits to perform quantum computations. With entanglement, we teleported the information in an unknown qubit to another qubit. This is quite a substantial achievement.
APA, Harvard, Vancouver, ISO, and other styles
5

Helmke, Stefan, Bernhard Goetze, Robert Scheffler, and Gregor Wrobel. "Interactive, Orthogonal Hyperedge Routing in Schematic Diagrams Assisted by Layout Automatisms." In Diagrammatic Representation and Inference. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-86062-2_2.

Full text
Abstract:
AbstractSchematic diagrams are used in graph-based engineering systems. They focus mainly on the structure of the design object. Graph-based engineering systems help to solve a concrete design task. This is primarily realized by the application of domain-specific languages. The layout of schematic diagrams is of particular importance, and a neat representation is desirable. But automatically generated layouts cannot always fully match the intention of a modeler. To improve automatic layouts and enable a user-specific representation, an algorithm that allows interactive changes of the orthogonal hyperedge geometry was implemented. In this paper, we present this algorithm and give an overview of such interactions. Additionally, several reductions of the hyperedge geometry are shown. Furthermore, a local, automatic routing considering interactions on the hyperedge geometry is presented. The consideration of domain-specific semantics and the possibility of interactive changes is a new approach. All algorithms were implemented in a self-developed software framework.
APA, Harvard, Vancouver, ISO, and other styles
6

Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Michal Koucký. "The Big Match in Small Space." In Algorithmic Game Theory. Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53354-3_6.

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

Shibuya, Tetsuo, and Igor Kurochkin. "Match Chaining Algorithms for cDNA Mapping." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39763-2_33.

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

Kunde, Manfred. "Block gossiping on grids and tori: Deterministic sorting and routing match the bisection bound." In Algorithms—ESA '93. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57273-2_62.

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

Bienkowski, Marcin, Artur Kraska, and Paweł Schmidt. "A Match in Time Saves Nine: Deterministic Online Matching with Delays." In Approximation and Online Algorithms. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89441-6_11.

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

Li, Ming. "Partial Match Distance." In Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-44958-1_4.

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

Conference papers on the topic "March algorithms"

1

Walters, B. D., and W. A. Clarke. "Comparison of two terrestrial atmospheric turbulence suppression algorithms (March 2007)." In AFRICON 2007. IEEE, 2007. http://dx.doi.org/10.1109/afrcon.2007.4401539.

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

Ma Lin, Chen Yunji, Su Menghao, Qi Zichu, Zhang Heng, and Hu Weiwu. "Testing content addressable memories using instructions and march-like algorithms." In 2008 15th IEEE International Conference on Electronics, Circuits and Systems - (ICECS 2008). IEEE, 2008. http://dx.doi.org/10.1109/icecs.2008.4674968.

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

Neumayr, Andrea, and Martin Otter. "Algorithms for Component-Based 3D Modeling." In The 13th International Modelica Conference, Regensburg, Germany, March 4–6, 2019. Linköing University Electronic Press, 2019. http://dx.doi.org/10.3384/ecp19157383.

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

Mohammadi, Fatemeh, Carmen Arévalo, and Claus Führer. "Restarting algorithms for simulation problems with discontinuities." In the 10th International Modelica Conference, March 10-12, 2014, Lund, Sweden. Linköping University Electronic Press, 2014. http://dx.doi.org/10.3384/ecp14096819.

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

Koshy, Twinkle, and C. S. Arun. "Diagnostic data detection of faults in RAM using different march algorithms with BIST scheme." In 2016 International Conference on Emerging Technological Trends (ICETT). IEEE, 2016. http://dx.doi.org/10.1109/icett.2016.7873754.

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

Ramsey-Goldman, R., T. Walunas, K. Jackson, et al. "PS6:124 Algorithms to identify sle from ehr data." In 11th European Lupus Meeting, Düsseldorf, Germany, 21–24 March 2018, Abstract presentations. Lupus Foundation of America, 2018. http://dx.doi.org/10.1136/lupus-2018-abstract.167.

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

Bhetariya, Preetida J., Sabine Hellwig, David A. Nix, Gabor T. Marth, Mary P. Bronner, and Hunter R. Underhill. "Abstract 2220: Benchmarking of somatic variant calling algorithms for detection of circulating tumor DNA." In Proceedings: AACR Annual Meeting 2019; March 29-April 3, 2019; Atlanta, GA. American Association for Cancer Research, 2019. http://dx.doi.org/10.1158/1538-7445.am2019-2220.

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

Bhetariya, Preetida J., Sabine Hellwig, David A. Nix, Gabor T. Marth, Mary P. Bronner, and Hunter R. Underhill. "Abstract 2220: Benchmarking of somatic variant calling algorithms for detection of circulating tumor DNA." In Proceedings: AACR Annual Meeting 2019; March 29-April 3, 2019; Atlanta, GA. American Association for Cancer Research, 2019. http://dx.doi.org/10.1158/1538-7445.sabcs18-2220.

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

Nicolai, Andreas, Anne Paepcke, and Hauke Hirsch. "Robust and accurate co-simulation master algorithms applied to FMI slaves with discontinuous signals using FMI 2.0 features." In The 13th International Modelica Conference, Regensburg, Germany, March 4–6, 2019. Linköing University Electronic Press, 2019. http://dx.doi.org/10.3384/ecp19157769.

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

Potier, A., E. Dufay, A. Dony, et al. "5PSQ-208 Pharmaceutical algorithms targeting anticoagulant therapy: impact of AVICENNE clinical decision support in patient safety." In 25th Anniversary EAHP Congress, Hospital Pharmacy 5.0 – the future of patient care, 23–28 March 2021. British Medical Journal Publishing Group, 2021. http://dx.doi.org/10.1136/ejhpharm-2021-eahpconf.327.

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

Reports on the topic "March algorithms"

1

McHugh, P. R. An investigation of Newton-Krylov algorithms for solving incompressible and low Mach number compressible fluid flow and heat transfer problems using finite volume discretization. Office of Scientific and Technical Information (OSTI), 1995. http://dx.doi.org/10.2172/130602.

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

Ruiz, Pablo, Craig Perry, Alejando Garcia, et al. The Everglades National Park and Big Cypress National Preserve vegetation mapping project: Interim report—Northwest Coastal Everglades (Region 4), Everglades National Park (revised with costs). National Park Service, 2020. http://dx.doi.org/10.36967/nrr-2279586.

Full text
Abstract:
The Everglades National Park and Big Cypress National Preserve vegetation mapping project is part of the Comprehensive Everglades Restoration Plan (CERP). It is a cooperative effort between the South Florida Water Management District (SFWMD), the United States Army Corps of Engineers (USACE), and the National Park Service’s (NPS) Vegetation Mapping Inventory Program (VMI). The goal of this project is to produce a spatially and thematically accurate vegetation map of Everglades National Park and Big Cypress National Preserve prior to the completion of restoration efforts associated with CERP. T
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'March algorithms' 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