Log in

Relevant bibliographies by topics / Problem trees

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Problem trees'

Author: Grafiati

Published: 4 June 2021

Last updated: 7 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 'Problem trees.'

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 "Problem trees"

1

Enayat, Ali. "Trees and Keislers problem." Archive for Mathematical Logic 40, no. 4 (2001): 273–76. http://dx.doi.org/10.1007/s001530000061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Butcher, John. "Trees, Stumps, and Applications." Axioms 7, no. 3 (2018): 52. http://dx.doi.org/10.3390/axioms7030052.

Full text

Abstract:

The traditional derivation of Runge–Kutta methods is based on the use of the scalar test problem y′(x)=f(x,y(x)). However, above order 4, this gives less restrictive order conditions than those obtained from a vector test problem using a tree-based theory. In this paper, stumps, or incomplete trees, are introduced to explain the discrepancy between the two alternative theories. Atomic stumps can be combined multiplicatively to generate all trees. For the scalar test problem, these quantities commute, and certain sets of trees form isomeric classes. There is a single order condition for each cl

APA, Harvard, Vancouver, ISO, and other styles

3

Cieslik, D., A. Dress, and W. Fitch. "Steiner's problem in double trees." Applied Mathematics Letters 15, no. 7 (2002): 855–60. http://dx.doi.org/10.1016/s0893-9659(02)00053-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Cady, Jo Ann, and Pamela J. Wells. "Pruning Trees." Mathematics Teaching in the Middle School 22, no. 1 (2016): 6–10. http://dx.doi.org/10.5951/mathteacmiddscho.22.1.0006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

ITO, TAKEHIRO, XIAO ZHOU, and TAKAO NISHIZEKI. "PARTITIONING TREES OF SUPPLY AND DEMAND." International Journal of Foundations of Computer Science 16, no. 04 (2005): 803–27. http://dx.doi.org/10.1142/s0129054105003303.

Full text

Abstract:

Assume that a tree T has a number ns of "supply vertices" and all the other vertices are "demand vertices." Each supply vertex is assigned a positive number called a supply, while each demand vertex is assigned a positive number called a demand. One wishes to partition T into exactly ns subtrees by deleting edges from T so that each subtree contains exactly one supply vertex whose supply is no less than the sum of demands of all demand vertices in the subtree. The "partition problem" is a decision problem to ask whether T has such a partition. The "maximum partition problem" is an optimization

APA, Harvard, Vancouver, ISO, and other styles

6

Joncour, Cédric, Arnaud Pêcher, and Petru Valicov. "MPQ-trees for orthogonal packing problem." Electronic Notes in Discrete Mathematics 36 (August 2010): 423–29. http://dx.doi.org/10.1016/j.endm.2010.05.054.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chin, Kien-Weh, and Hsu-Chun Yen. "The symmetry number problem for trees." Information Processing Letters 79, no. 2 (2001): 73–79. http://dx.doi.org/10.1016/s0020-0190(00)00174-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Kuo, David, and Gerard J. Chang. "The Profile Minimization Problem in Trees." SIAM Journal on Computing 23, no. 1 (1994): 71–81. http://dx.doi.org/10.1137/s009753979119607x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Seward, Brandon. "Burnside’s Problem, spanning trees and tilings." Geometry & Topology 18, no. 1 (2014): 179–210. http://dx.doi.org/10.2140/gt.2014.18.179.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Blanke, Michael M., and John P. Bower. "Small fruit problem in Citrus trees." Trees 5, no. 4 (1991): 239–43. http://dx.doi.org/10.1007/bf00227531.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Problem trees"

1

Lunday, Brian Joseph. "The modified covering problem on paths and trees." Thesis, The University of Arizona, 2001. http://hdl.handle.net/10150/291733.

Full text

Abstract:

The Modified Covering Problem (MCP) is introduced and theory is developed for solving it on paths and trees. First, the Modified Covering Problem is defined as a subset of the Conditional Covering Problem, and motivations are proposed for its study. Next, a literature review examines relevant, published material. The MCP is then formulated as a binary integer program, followed by an examination of the characteristics of its feasible solutions, optimality, and overall complexity. A polynomial algorithm is developed for the solving the MCP on paths with uniform link distances, and solving within

APA, Harvard, Vancouver, ISO, and other styles

2

Nikolaev, Andrey. "Membership problem in groups acting freely on non-archimedean trees." Thesis, McGill University, 2010. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=95131.

Full text

Abstract:

Groups acting freely on $\mathbb Z^n$-trees ($\mathbb Z^n$-free groups) play a key role in the study of non-archimedean group actions. Following Stallings' ideas, we develop graph-theoretic techniques to investigate subgroup structure of $\mathbb Z^n$-free groups. As an immediate application of the presented method, we give an effective solution to the Uniform Membership Problem and the Power Problem in $\mathbb Z^n$-free groups.<br>Les groupes agissant librement sur les $\mathbb Z^n$-arbres (les groupes $\mathbb Z^n$-libres) ont un rôle clé dans l'étude des actions non-archimédiennes de grou

APA, Harvard, Vancouver, ISO, and other styles

3

Littlefield, Joanne. "Trees, Grasslands and Global Change: New Perspectives on an Old Problem." College of Agriculture and Life Sciences, University of Arizona (Tucson, AZ), 2005. http://hdl.handle.net/10150/622199.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Biyikoglu, Türker, and Josef Leydold. "Faber-Krahn Type Inequalities for Trees." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2003. http://epub.wu.ac.at/826/1/document.pdf.

Full text

Abstract:

The Faber-Krahn theorem states that among all bounded domains with the same volume in Rn (with the standard Euclidean metric), a ball that has lowest first Dirichlet eigenvalue. Recently it has been shown that a similar result holds for (semi-)regular trees. In this article we show that such a theorem also hold for other classes of (not necessarily non-regular) trees. However, for these new results no couterparts in the world of the Laplace-Beltrami-operator on manifolds are known.<br>Series: Preprint Series / Department of Applied Statistics and Data Processing

APA, Harvard, Vancouver, ISO, and other styles

5

MOLINARO, MARCO SERPA. "IMPROVED APPROXIMATIONS FOR THE K-HOTLINK ASSIGNMENT PROBLEM AND FOR BINARY SEARCHING IN TREES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2008. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=11879@1.

Full text

Abstract:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>Neste trabalho, apresentamos algoritmos aproximativos para dois problemas de otimização em árvores. Na primeira parte, consideramos o Problema de Atribuição de k-Hotlinks. Seja G= (V,E) um grafo direcionado acíclico representando um web site, onde nós correspondem a páginas e arcos correspondem a hyperlinks. Nesse contexto, hotlink são definidos como atalhos (novos arcos) adicionados às páginas de G de modo a

APA, Harvard, Vancouver, ISO, and other styles

6

Leydold, Josef. "A Faber-Krahn-type Inequality for Regular Trees." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 1996. http://epub.wu.ac.at/778/1/document.pdf.

Full text

Abstract:

In the last years some results for the Laplacian on manifolds have been shown to hold also for the graph Laplacian, e.g. Courant's nodal domain theorem or Cheeger's inequality. Friedman (Some geometric aspects of graphs and their eigenfunctions, Duke Math. J. 69 (3), pp. 487-525, 1993) described the idea of a ``graph with boundary". With this concept it is possible to formulate Dirichlet and Neumann eigenvalue problems. Friedman also conjectured another ``classical" result for manifolds, the Faber-Krahn theorem, for regular bounded trees with boundary. The Faber-Krahn theorem states that among

APA, Harvard, Vancouver, ISO, and other styles

7

Saka, Esin. "A Comparative Study Of Tree Encodings For Evolutionary Computing." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/3/12606317/index.pdf.

Full text

Abstract:

One of the most important factors on the success of evolutionary algorithms (EAs) about trees is the representation of them. The representation should exhibit efficiency, locality and heritability to enable effective evolutionary computing. Neville proposed three different methods for encoding labeled trees. The first one is similar with Pr&uuml<br>fer&#039<br>s encoding. In 2001, it is reported that, the use of Pr&uuml<br>fer numbers is a poor representation of spanning trees for evolutionary search, since it has low locality for random trees. In the thesis Neville&#039<br>s other two encodin

APA, Harvard, Vancouver, ISO, and other styles

8

Sabbir, Tarikul Alam Khan. "Topology sensitive algorithms for large scale uncapacitated covering problem." Thesis, Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2011, 2011. http://hdl.handle.net/10133/3235.

Full text

Abstract:

Solving NP-hard facility location problems in wireless network planning is a common scenario. In our research, we study the Covering problem, a well known facility location problem with applications in wireless network deployment. We focus on networks with a sparse structure. First, we analyzed two heuristics of building Tree Decomposition based on vertex separator and perfect elimination order. We extended the vertex separator heuristic to improve its time performance. Second, we propose a dynamic programming algorithm based on the Tree Decomposition to solve the Covering problem optimally on

APA, Harvard, Vancouver, ISO, and other styles

9

Ramineni, Narahari. "Tree Restructuring Approach to Mapping Problem in Cellular Architecture FPGAS." PDXScholar, 1995. https://pdxscholar.library.pdx.edu/open_access_etds/4914.

Full text

Abstract:

This thesis presents a new technique for mapping combinational circuits to Fine-Grain Cellular-Architecture FPGAs. We represent the netlist as the binary tree with decision variables associated with each node of the tree. The functionality of the tree nodes is chosen based on the target FPGA architecture. The proposed tree restructuring algorithms preserve local connectivity and allow direct mapping of the trees to the cellular array, thus eliminating the traditional routing phase. Also, predictability of the signal delays is a very important advantage of the developed approach. The developed

APA, Harvard, Vancouver, ISO, and other styles

10

Leydold, Josef. "The Geometry of Regular Trees with the Faber-Krahn Property." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 1998. http://epub.wu.ac.at/416/1/document.pdf.

Full text

Abstract:

In this paper we prove a Faber-Krahn-type inequality for regular trees and give a complete characterization of extremal trees. It extends a former result of the author. The main tools are rearrangements and perturbation of regular trees. (author's abstract)<br>Series: Preprint Series / Department of Applied Statistics and Data Processing

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Problem trees"

1

Rao, Balakrishna. Landscape problem management. Landscape Management, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Zum Problem des Pollenfluges in den Hochalpen. J. Cramer, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Dror, Moshe. Directed Steiner tree problem on a graph: Models, relaxations, and algorithms. Naval Postgraduate School, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Indian Institute of Management, Ahemdabad., ed. A probabilistic tabu search algorithm for the generalized minimum spanning tree problem. Indian Institute of Management, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Dettmer, H. William. The logical thinking process: A systems approach to complex problem solving. ASQ Quality Press, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Sullivan, Thomas Priestlay. Impact of porcupine feeding damage on intensive forest management in the Prince Rupert Forest Region: Problem analysis. Forestry Canada, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mellett, Peter. Trees. Sebastian Kelly, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Backyard problem solver: 2,168 natural solutions for growing great grass, super shrubs, bright bulbs, perfect perennials, amazing annuals, vibrant vegetables, terrific trees, and much, much more! American Master Products, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Hwang, Frank. The Steiner tree problem. North-Holland, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Hwang, Frank K. The Steiner tree problem. North-Holland, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Problem trees"

1

Duin, Cees. "Preprocessing the Steiner Problem in Graphs." In Advances in Steiner Trees. Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-3171-2_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Zhou, Jie, Tianming Bu, Hong Zhu, and Yixiang Chen. "Vehicle Scheduling Problem on Trees." In Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-37502-6_64.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Wade, A. S. C., and V. J. Rayward-Smith. "Effective Local Search Techniques for the Steiner Tree Problem." In Advances in Steiner Trees. Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-3171-2_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Ryvkin, Paul, and Li-San Wang. "Phylogenetic Trees From Sequences." In Problem Solving Handbook in Computational Biology and Bioinformatics. Springer US, 2010. http://dx.doi.org/10.1007/978-0-387-09760-2_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Klau, Gunnar W., Ivana Ljubić, Petra Mutzel, Ulrich Pferschy, and René Weiskircher. "The Fractional Prize-Collecting Steiner Tree Problem on Trees." In Algorithms - ESA 2003. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39658-1_62.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Gupta, Arvind, Ján Maňuch, Ladislav Stacho, and Chenchen Zhu. "Small Phylogeny Problem: Character Evolution Trees." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27801-6_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bock, Adrian, Elyot Grant, Jochen Könemann, and Laura Sanità. "The School Bus Problem on Trees." In Algorithms and Computation. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25591-5_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Garrette, Bernard, Corey Phelps, and Olivier Sibony. "Structure the Problem: Pyramids and Trees." In Cracked it! Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89375-4_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Bhabak, Puspal, and Hovhannes A. Harutyunyan. "Broadcast Problem in Hypercube of Trees." In Frontiers in Algorithmics. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08016-1_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Dey, Sanjana, Anil Maheshwari, and Subhas C. Nandy. "Minimum Consistent Subset Problem for Trees." In Fundamentals of Computation Theory. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-86593-1_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Problem trees"

1

Oliveira, Andrey, Danilo Sanches, and Bruna Osti. "Hybrid greedy genetic algorithm for the Euclidean Steiner tree problem." In Encontro Nacional de Inteligência Artificial e Computacional. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/eniac.2019.9350.

Full text

Abstract:

This paper presents a genetic algorithm for the Euclidean Steiner tree problem. This is an optimization problem whose objective is to obtain a minimum length tree to interconnect a set of fixed points, and for this purpose to be achieved, new auxiliary points, called Steiner points, can be added. The proposed heuristic uses a genetic algorithm to manipulate spanning trees, which are then transformed into Steiner trees by inserting and repositioning the Steiner points. Greedy genetic operators and evolutionary strategies are tested. Results of numerical experiments for benchmark library problem

APA, Harvard, Vancouver, ISO, and other styles

2

Vargas-Silva, Gustavo, and Mariappan Jawaharlal. "Hands-On Experiences for Problem Solving in Engineering Education Based on Trees and Plants." In ASME 2018 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/imece2018-87583.

Full text

Abstract:

We teachers know that problem solving is a crucial skill for our students. It is indispensable for developing original and creative thinking. We also know that deep learning of engineering fact can be assisted by using non-conventional tools and heterodox ideas for teaching, learning and presenting technical concepts. On that sense, we propose that engineering students could learn how to solve hands-on problems from nature; in particular from the plant kingdom. In addition, we engineers should not turn our back to nature. We should start a new voyage of discovery, seeking new landscapes with a

APA, Harvard, Vancouver, ISO, and other styles

3

Tian Hu and Bao-Hua Zhao. "Splitter Placement Problem on Directed Fiber Trees." In Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05). IEEE, 2005. http://dx.doi.org/10.1109/pdcat.2005.226.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Pelikan, Martin, Shigeyoshi Tsutsui, and Rajiv Kalapala. "Dependency trees, permutations, and quadratic assignment problem." In the 9th annual conference. ACM Press, 2007. http://dx.doi.org/10.1145/1276958.1277089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Johnson, Tyler A., Avery Cheeley, Benjamin W. Caldwell, and Matthew G. Green. "Comparison and Extension of Novelty Metrics for Problem-Solving Tasks." In ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-60319.

Full text

Abstract:

Shah’s metrics for measuring ideation effectiveness have been used extensively by the engineering design community to quantify the value of designed concepts. Shah measures novelty as the infrequency of an idea relative to a set of ideas. Vargas-Hernandez extended this novelty metric using partial genealogy trees to consider the frequency of ideas that share the same working principle. These genealogy trees capture differences between individual ideas organized by the following levels of abstraction: physical principle, working principle, and embodiment. Shah’s and Vargas-Hernandez’s metrics b

APA, Harvard, Vancouver, ISO, and other styles

6

Oliveira, Ricardo Tavares de, and Fabiano Silva. "SAT and MaxSAT Encodings for Trees Applied to the Steiner Tree Problem." In 2014 Brazilian Conference on Intelligent Systems (BRACIS). IEEE, 2014. http://dx.doi.org/10.1109/bracis.2014.43.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Yang, Jianfang, and Juan Jiang. "Reverse 1-median Problem with Constraint in Trees." In 2nd International Conference on Computer Application and System Modeling. Atlantis Press, 2012. http://dx.doi.org/10.2991/iccasm.2012.19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Narodytska, Nina, Alexey Ignatiev, Filipe Pereira, and Joao Marques-Silva. "Learning Optimal Decision Trees with SAT." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/189.

Full text

Abstract:

Explanations of machine learning (ML) predictions are of fundamental importance in different settings. Moreover, explanations should be succinct, to enable easy understanding by humans. Decision trees represent an often used approach for developing explainable ML models, motivated by the natural mapping between decision tree paths and rules. Clearly, smaller trees correlate well with smaller rules, and so one challenge is to devise solutions for computing smallest size decision trees given training data. Although simple to formulate, the computation of smallest size decision trees turns out to

APA, Harvard, Vancouver, ISO, and other styles

9

Panda, Biswanath, Mirek Riedewald, and Daniel Fink. "The model-summary problem and a solution for trees." In 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010). IEEE, 2010. http://dx.doi.org/10.1109/icde.2010.5447912.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Pan, Ting, Baolei Cheng, Jianxi Fan, Cheng-Kuan Lin, and Dongfang Zhou. "Toward the completely independent spanning trees problem on BCube." In 2017 IEEE 9th International Conference on Communication Software and Networks (ICCSN). IEEE, 2017. http://dx.doi.org/10.1109/iccsn.2017.8230281.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Problem trees"

1

Mayr, Ernst W. The Dynamic Tree Expression Problem,. Defense Technical Information Center, 1987. http://dx.doi.org/10.21236/ada323937.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Dror, Moshe, Bezalel Gavish, and Jean Choquette. Directed Steiner Tree Problem on a Graph: Models, Relaxations, and Algorithms. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada199769.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Türker, Uraz Cengiz. Hardness and inapproximability results for minimum verification set and minimum path decision tree problems. Sabancı University, 2012. http://dx.doi.org/10.5900/su_fens_wp.2012.19826.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sackett, Stephen S., and Sally M. Haase. Measuring soil and tree temperatures during prescribed fires with thermocouple probes. U.S. Department of Agriculture, Forest Service, Pacific Southwest Research Station, 1992. http://dx.doi.org/10.2737/psw-gtr-131.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

NORMAN, E. C. Acceptance Test Plan for Fourth-Generation Hanford Corrosion Probe Tree Assembly. Office of Scientific and Technical Information (OSTI), 2000. http://dx.doi.org/10.2172/805388.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

CANNON, N. S. Multifunction Instrument Tree (MIT) Neutron and Gamma Probe Acceptance for Beneficial Use (ABU). Office of Scientific and Technical Information (OSTI), 1999. http://dx.doi.org/10.2172/797744.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Raychev, Nikolay. Can human thoughts be encoded, decoded and manipulated to achieve symbiosis of the brain and the machine. Web of Open Science, 2020. http://dx.doi.org/10.37686/nsrl.v1i2.76.

Full text

Abstract:

This article discusses the current state of neurointerface technologies, not limited to deep electrode approaches. There are new heuristic ideas for creating a fast and broadband channel from the brain to artificial intelligence. One of the ideas is not to decipher the natural codes of nerve cells, but to create conditions for the development of a new language for communication between the human brain and artificial intelligence tools. Theoretically, this is possible if the brain "feels" that by changing the activity of nerve cells that communicate with the computer, it is possible to "achieve

APA, Harvard, Vancouver, ISO, and other styles

9

CANNON, N. S. Engineering task plan for determining the interstitial liquid level in tank 241-SY-101 utilizing a neutron probe in the multifunction instrument tree. Office of Scientific and Technical Information (OSTI), 1999. http://dx.doi.org/10.2172/781524.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Botero Mariaca, Paola María, Natalia Vélez Trujillo, Claudia Cecilia Restrepo Serna, and Libbe Mariaca Cartagena. Manual de ortodoncia interceptiva: teoría y práctica. Ediciones Universidad Cooperativa de Colombia, 2020. http://dx.doi.org/10.16925/gcgp.28.

Full text

Abstract:

El proceso de transición dental para prevenir o interceptar las maloclusiones, es decir, el desarrollo de la dentición humana, se demora 12 años, por lo que muchos factores externos influyen en él. El grado de desarmonía oclusal que resulta luego del desarrollo es determinado por los cambios compensatorios que suceden con el crecimiento; las interferencias en el desarrollo de oclusión pueden llevar a una maloclusión. En la literatura se contemplan tres términos que importa diferenciar: ortodoncia preventiva, ortodoncia interceptiva y ortodoncia correctiva. La primera busca prevenir las interfe

APA, Harvard, Vancouver, ISO, and other styles

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!