Gotowe bibliografie tematyczne / Computation Theory and Mathematics

Gotowa bibliografia na temat „Computation Theory and Mathematics”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 29 stycznia 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Computation Theory and Mathematics”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Computation Theory and Mathematics"

Dean, Walter. "Computational Complexity Theory and the Philosophy of Mathematics†". Philosophia Mathematica 27, nr 3 (1.10.2019): 381–439. http://dx.doi.org/10.1093/philmat/nkz021.

Pełny tekst źródła

Streszczenie:

Abstract Computational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems. Amongst its aims is classifying problems by their degree of difficulty — i.e., how hard they are to solve computationally. This paper highlights the significance of complexity theory relative to questions traditionally asked by philosophers of mathematics while also attempting to isolate some new ones — e.g., about the notion of feasibility in mathematics, the $\mathbf{P} \neq \mathbf{NP}$ problem and why it has proven hard to resolve, and the role of non-classical modes of computation and proof.

Style APA, Harvard, Vancouver, ISO itp.

Maley, Carlo C. "DNA Computation: Theory, Practice, and Prospects". Evolutionary Computation 6, nr 3 (wrzesień 1998): 201–29. http://dx.doi.org/10.1162/evco.1998.6.3.201.

Pełny tekst źródła

Streszczenie:

L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also identified three broad categories of open questions for the field. First, is DNA capable of universal computation? Second, what kinds of algorithms can DNA implement? Third, can the error rates in the manipulations of the DNA be controlled enough to allow for useful computation? In the two years that have followed, theoretical work has shown that DNA is in fact capable of universal computation. Furthermore, algorithms for solving interesting questions, like breaking the Data Encryption Standard, have been described using currently available technology and methods. Finally, a few algorithms have been proposed to handle some of the apparently crippling error rates in a few of the common processes used to manipulate DNA. It is thus unlikely that DNA computation is doomed to be only a passing curiosity. However, much work remains to be done on the containment and correction of errors. It is far from clear if the problems in the error rates can be solved sufficiently to ever allow for general-purpose computation that will challenge the more popular substrates for computation. Unfortunately, biological demonstrations of the theoretical results have been sadly lacking. To date, only the simplest of computations have been carried out in DNA. To make significant progress, the field will require both the assessment of the practicality of the different manipulations of DNA and the implementation of algorithms for realistic problems. Theoreticians, in collaboration with experimentalists, can contribute to this research program by settling on a small set of practical and efficient models for DNA computation.

Style APA, Harvard, Vancouver, ISO itp.

Yamada, Shinichi. "A mathematical theory of randomized computation, I". Proceedings of the Japan Academy, Series A, Mathematical Sciences 64, nr 4 (1988): 115–18. http://dx.doi.org/10.3792/pjaa.64.115.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Yamada, Shinichi. "A mathematical theory of randomized computation, II". Proceedings of the Japan Academy, Series A, Mathematical Sciences 64, nr 5 (1988): 155–58. http://dx.doi.org/10.3792/pjaa.64.155.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Yamada, Shinichi. "A mathematical theory of randomized computation, III". Proceedings of the Japan Academy, Series A, Mathematical Sciences 64, nr 6 (1988): 201–4. http://dx.doi.org/10.3792/pjaa.64.201.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Duhr, Claude. "Function Theory for Multiloop Feynman Integrals". Annual Review of Nuclear and Particle Science 69, nr 1 (19.10.2019): 15–39. http://dx.doi.org/10.1146/annurev-nucl-101918-023551.

Pełny tekst źródła

Streszczenie:

Precise predictions for collider observables require the computation of higher orders in perturbation theory. This task usually involves the evaluation of complicated multiloop integrals, which typically give rise to complicated special functions. This article discusses recent progress in understanding the mathematics underlying multiloop Feynman integrals and discusses a class of functions that generalizes the logarithm and that often appears in multiloop computations. The same class of functions is an active area of research in modern mathematics, which has led to the development of new powerful tools to compute Feynman integrals. These tools are at the heart of some of the most complicated computations ever performed for a hadron collider.

Style APA, Harvard, Vancouver, ISO itp.

Lenstra Jr., H. W., Steven M. Serbin, Stig Larsson, Ohannes Karakashian, J. Thomas King i Ewald Quak. "Book Review: Mathematics of Computation 1943--1993: A half-century of computational mathematics". Mathematics of Computation 66, nr 219 (1.07.1997): 1367–75. http://dx.doi.org/10.1090/s0025-5718-97-00877-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Conceição, Ana C., i Jéssica C. Pires. "Symbolic Computation Applied to Cauchy Type Singular Integrals". Mathematical and Computational Applications 27, nr 1 (31.12.2021): 3. http://dx.doi.org/10.3390/mca27010003.

Pełny tekst źródła

Streszczenie:

The development of operator theory is stimulated by the need to solve problems emerging from several fields in mathematics and physics. At the present time, this theory has wide applications in the study of non-linear differential equations, in linear transport theory, in the theory of diffraction of acoustic and electromagnetic waves, in the theory of scattering and of inverse scattering, among others. In our work, we use the computer algebra system Mathematica to implement, for the first time on a computer, analytical algorithms developed by us and others within operator theory. The main goal of this paper is to present new operator theory algorithms related to Cauchy type singular integrals, defined in the unit circle. The design of these algorithms was focused on the possibility of implementing on a computer all the extensive symbolic and numeric calculations present in the algorithms. Several nontrivial examples computed with the algorithms are presented. The corresponding source code of the algorithms has been made available as a supplement to the online edition of this article.

Style APA, Harvard, Vancouver, ISO itp.

Edalat, Abbas. "Domains for Computation in Mathematics, Physics and Exact Real Arithmetic". Bulletin of Symbolic Logic 3, nr 4 (grudzień 1997): 401–52. http://dx.doi.org/10.2307/421098.

Pełny tekst źródła

Streszczenie:

AbstractWe present a survey of the recent applications of continuous domains for providing simple computational models for classical spaces in mathematics including the real line, countably based locally compact spaces, complete separable metric spaces, separable Banach spaces and spaces of probability distributions. It is shown how these models have a logical and effective presentation and how they are used to give a computational framework in several areas in mathematics and physics. These include fractal geometry, where new results on existence and uniqueness of attractors and invariant distributions have been obtained, measure and integration theory, where a generalization of the Riemann theory of integration has been developed, and real arithmetic, where a feasible setting for exact computer arithmetic has been formulated. We give a number of algorithms for computation in the theory of iterated function systems with applications in statistical physics and in period doubling route to chaos; we also show how efficient algorithms have been obtained for computing elementary functions in exact real arithmetic.

Style APA, Harvard, Vancouver, ISO itp.

Doerr, Benjamin, i Thomas Jansen. "Theory of Evolutionary Computation". Algorithmica 59, nr 3 (9.11.2010): 299–300. http://dx.doi.org/10.1007/s00453-010-9472-3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Rozprawy doktorskie na temat "Computation Theory and Mathematics"

Bryant, Ross. "A Computation of Partial Isomorphism Rank on Ordinal Structures". Thesis, University of North Texas, 2006. https://digital.library.unt.edu/ark:/67531/metadc5387/.

Pełny tekst źródła

Streszczenie:

We compute the partial isomorphism rank, in the sense Scott and Karp, of a pair of ordinal structures using an Ehrenfeucht-Fraisse game. A complete formula is proven by induction given any two arbitrary ordinals written in Cantor normal form.

Style APA, Harvard, Vancouver, ISO itp.

Zhang, Yue. "Sparsity in Image Processing and Machine Learning: Modeling, Computation and Theory". Case Western Reserve University School of Graduate Studies / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=case1523017795312546.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Semegni, Jean Yves. "On the computation of freely generated modular lattices". Thesis, Stellenbosch : Stellenbosch University, 2008. http://hdl.handle.net/10019.1/1207.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Khafizov, Farid T. "Descriptions and Computation of Ultrapowers in L(R)". Thesis, University of North Texas, 1995. https://digital.library.unt.edu/ark:/67531/metadc277867/.

Pełny tekst źródła

Streszczenie:

The results from this dissertation are an exact computation of ultrapowers by measures on cardinals $\aleph\sb{n},\ n\in w$, in $L(\IR$), and a proof that ordinals in $L(\IR$) below $\delta\sbsp{5}{1}$ represented by descriptions and the identity function with respect to sequences of measures are cardinals. An introduction to the subject with the basic definitions and well known facts is presented in chapter I. In chapter II, we define a class of measures on the $\aleph\sb{n},\ n\in\omega$, in $L(\IR$) and derive a formula for an exact computation of the ultrapowers of cardinals by these measures. In chapter III, we give the definitions of descriptions and the lowering operator. Then we prove that ordinals represented by descriptions and the identity function are cardinals. This result combined with the fact that every cardinal $<\delta\sbsp{5}{1}$ in $L(\IR$) is represented by a description (J1), gives a characterization of cardinals in $L(\IR$) below $\delta\sbsp{5}{1}. Concrete examples of formal computations are shown in chapter IV.

Style APA, Harvard, Vancouver, ISO itp.

Theeranaew, Wanchat. "STUDY ON INFORMATION THEORY: CONNECTION TO CONTROL THEORY, APPROACH AND ANALYSIS FOR COMPUTATION". Case Western Reserve University School of Graduate Studies / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=case1416847576.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Marsden, Daniel. "Logical aspects of quantum computation". Thesis, University of Oxford, 2015. http://ora.ox.ac.uk/objects/uuid:e99331a3-9d93-4381-8075-ad843fb9b77c.

Pełny tekst źródła

Streszczenie:

A fundamental component of theoretical computer science is the application of logic. Logic provides the formalisms by which we can model and reason about computational questions, and novel computational features provide new directions for the development of logic. From this perspective, the unusual features of quantum computation present both challenges and opportunities for computer science. Our existing logical techniques must be extended and adapted to appropriately model quantum phenomena, stimulating many new theoretical developments. At the same time, tools developed with quantum applications in mind often prove effective in other areas of logic and computer science. In this thesis we explore logical aspects of this fruitful source of ideas, with category theory as our unifying framework. Inspired by the success of diagrammatic techniques in quantum foundations, we begin by demonstrating the effectiveness of string diagrams for practical calculations in category theory. We proceed by example, developing graphical formulations of the definitions and proofs of many topics in elementary category theory, such as adjunctions, monads, distributive laws, representable functors and limits and colimits. We contend that these tools are particularly suitable for calculations in the field of coalgebra, and continue to demonstrate the use of string diagrams in the remainder of the thesis. Our coalgebraic studies commence in chapter 3, in which we present an elementary formulation of a representation result for the unitary transformations, following work developed in a fibrational setting in [Abramsky, 2010]. That paper raises the question of what a suitable "fibred coalgebraic logic" would be. This question is the starting point for our work in chapter 5, in which we introduce a parameterized, duality based frame- work for coalgebraic logic. We show sufficient conditions under which dual adjunctions and equivalences can be lifted to fibrations of (co)algebras. We also prove that the semantics of these logics satisfy certain "institution conditions" providing harmony between syntactic and semantic transformations. We conclude by studying the impact of parameterization on another logical aspect of coalgebras, in which certain fibrations of predicates can be seen as generalized invariants. Our focus is on the lifting of coalgebra structure along a fibration from the base category to an associated total category of predicates. We show that given a suitable parameterized generalization of the usual liftings of signature functors, this induces a "fibration of fibrations" capturing the relationship between the two different axes of variation.

Style APA, Harvard, Vancouver, ISO itp.

Kirk, Neil Patrick. "Computational aspects of singularity theory". Thesis, University of Liverpool, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359187.

Pełny tekst źródła

Streszczenie:

In this thesis we develop computational methods suitable for performing the symbolic calculations common to local singularity theory. For classification theory we employ the unipotent determinacy techniques of Bruce, du Plessis, Wall and complete transversal theorems of Bruce, du Plessis. The latter results are, as yet, unpublished and we spend some time reviewing these results, extending them to filtrations of the module m,,,.E (n, p) other than the standard filtration by degree. Weighted filtrations and filtrations induced by the action of a nilpotent Lie algebra are considered. A computer package called Transversal is developed. This is written in the mathematical language Maple and performs calculations such as those mentioned above and those central to unfolding theory. We discuss the package in detail and give examples of calculations performed in this thesis. Several classifications are obtained. The first is an extensive classification of map-germs (R2,0) -p (R4,0) under A-equivalence. We also consider the classification of function-germs (CP, O) -f (C, 0) under R(D)-equivalence: the restriction of R-equivalence to source coordinate changes which preserve a discriminant variety, D. We consider the cases where D is the discriminant of the A2 and A3 singularities, extending the results of Arnol'd. Several other simple singularities are discussed briefly; in particular, we consider the cases where D is the discriminant of the A4, D4, D5, D6, and Ek singularities. The geometry of the singularities (R2,0) -f (R4,0) is investigated by calculating the adjacencies and several geometrical invariants. For the given source and target dimensions, the invariants associated to the double point schemes and L-codimension of the germs are particularly significant. Finally we give an application of computer graphics to singularity theory. A program is written (in C) which calculates and draws the family of profiles of a surface rotating about a fixed axis in R3, the resulting envelope of profiles, and several other geometrical features. The program was used in recent research by Rycroft. We review some of the results and conclude with computer produced images which demonstrate certain transitions of the singularities on the envelope.

Style APA, Harvard, Vancouver, ISO itp.

Fatouros, Stavros. "Approximate algebraic computations in control theory". Thesis, City University London, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.274524.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Heyman, Joseph Lee. "On the Computation of Strategically Equivalent Games". The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1561984858706805.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Fukasawa, Ricardo. "Single-row mixed-integer programs : theory and computations /". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24660.

Pełny tekst źródła

Streszczenie:

Thesis (Ph.D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2009.
Committee Chair: William J. Cook; Committee Member: Ellis Johnson; Committee Member: George Nemhauser; Committee Member: Robin Thomas; Committee Member: Zonghao Gu

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Książki na temat "Computation Theory and Mathematics"

Tourlakis, George J. Theory of computation. Hoboken, N.J: Wiley, 2012.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Theory of computation. New York, NY: Wiley, 1987.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Theory of computation. New York: Harper & Row, 1987.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Linear dependence: Theory and computation. New York: Kluwer Academic/Plenum Publishers, 2000.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Multiple criteria optimization: Theory, computation, and application. Malabar, Fla: Krieger, 1989.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Steuer, Ralph E. Multiple criteria optimization: Theory, computation, and application. New York: Wiley, 1986.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

FCT '85 (1985 Cottbus, Germany). Fundamentals of computation theory. Berlin: Springer-Verlag, 1985.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Electromagnetic field theory and computation. Hoboken, N.J: Wiley, 2010.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Dasgupta, D. Immunological computation: Theory and applications. Boca Raton: Auerbach Publications, 2009.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Dasgupta, D. Immunological computation: Theory and applications. Boca Raton: Auerbach Publications, 2009.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Części książek na temat "Computation Theory and Mathematics"

Sanders, Sam. "Reverse Mathematics and Computability Theory of Domain Theory". W Logic, Language, Information, and Computation, 550–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2019. http://dx.doi.org/10.1007/978-3-662-59533-6_33.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Kearfott, R. Baker. "Interval Mathematics Techniques for Control Theory Computations". W Computation and Control, 169–78. Boston, MA: Birkhäuser Boston, 1989. http://dx.doi.org/10.1007/978-1-4612-3704-4_12.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Shparlinski, Igor E. "Finite Fields and Discrete Mathematics". W Finite Fields: Theory and Computation, 265–324. Dordrecht: Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-015-9239-0_10.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Stewart, Iain A. "On the Mathematics of Data Centre Network Topologies". W Fundamentals of Computation Theory, 283–95. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-22177-9_22.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Smale, Stephen. "Theory of computation". W Mathematical Research Today and Tomorrow, 59–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/bfb0089205.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Friedman, Avner. "Computation of volume integrals in potential theory". W Mathematics in Industrial Problems, 122–30. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4615-7405-7_12.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Kaltofen, Erich L. "Symbolic Computation and Complexity Theory Transcript of My Talk". W Computer Mathematics, 3–7. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-43799-5_1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Peck, Robert W. "Almost Difference Sets in Transformational Music Theory". W Mathematics and Computation in Music, 63–75. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71827-9_6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Mazzola, Guerino. "ComMute—Towards a Computational Musical Theory of Everything". W Mathematics and Computation in Music, 21–30. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-21392-3_2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Freivalds, RŪsiņš. "Models of Computation, Riemann Hypothesis, and Classical Mathematics". W SOFSEM’ 98: Theory and Practice of Informatics, 89–106. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-49477-4_6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Computation Theory and Mathematics"

Alozn, Ahmad E., i Abdulla Galadari. "Utility function under decision theory: A construction arbitration application". W INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION: Empowering Engineering using Mathematics. Author(s), 2017. http://dx.doi.org/10.1063/1.4994404.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Setiawan, Ekky Kurnia, i I. Ketut Budayasa. "Application of graph theory concept for traffic light control at crossroad". W INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION: Empowering Engineering using Mathematics. Author(s), 2017. http://dx.doi.org/10.1063/1.4994457.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Gibbs, Alison L., i Alex Stringer. "The Fundamental Role of Computation in Teaching Statistical Theory". W IASE 2021 Satellite Conference: Statistics Education in the Era of Data Science. International Association for Statistical Education, 2022. http://dx.doi.org/10.52041/iase.rmcxl.

Pełny tekst źródła

Streszczenie:

What skills, knowledge and habits of mind does a statistician require in order to contribute effectively as an inhabitant of the data science ecosystem? We describe a new course in statistical theory that was developed as part of our consideration of this question. The course is a core requirement in a new curriculum for undergraduate students enrolled in statistics programs of study. Problem solving and critical thinking are developed through both mathematical and computational thinking and all ideas are motivated through questions to be answered from large, open and messy data. Central to the development of the course is the tenet that the use of computation is as fundamental to statistical thinking as the use of mathematics. We describe the course, including its connection to the learning outcomes of our new statistics program of study, and the multiple ways we use and integrate computation.

Style APA, Harvard, Vancouver, ISO itp.

Milasi, Monica, Annamaria Barbagallo, Theodore E. Simos, George Psihoyios i Ch Tsitouras. "Preface of Minisymposium “Variational Inequalities and Equilibrium Problems: Existence and Duality Theory and Computation”". W NUMERICAL ANALYSIS AND APPLIED MATHEMATICS: International Conference on Numerical Analysis and Applied Mathematics 2009: Volume 1 and Volume 2. AIP, 2009. http://dx.doi.org/10.1063/1.3241373.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

M. Bouniaev, Mikhail, i Nikolai P. Dolbilin. "Local Theory of Crystals: Development and Current Status". W Annual International Conference on Computational Mathematics, Computational Geometry & Statistics. Global Science and Technology Forum (GSTF), 2015. http://dx.doi.org/10.5176/2251-1911_cmcgs15.42.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Bethune, Iain. "PrimeGrid: a Volunteer Computing Platform for Number Theory". W Annual International Conference on Computational Mathematics, Computational Geometry & Statistics. Global Science and Technology Forum (GSTF), 2015. http://dx.doi.org/10.5176/2251-1911_cmcgs15.43.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Gale, Ella, Ben De Lacy Costello i Andrew Adamatzky. "Observation and characterization of memristor current spikes and their application to neuromorphic computation". W NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2012: International Conference of Numerical Analysis and Applied Mathematics. AIP, 2012. http://dx.doi.org/10.1063/1.4756553.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Zhigljavsky, Anatoly, i Vladimir Kornikov. "Classical areas of mathematics where the concept of grossone could be useful". W NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS (NUMTA–2016): Proceedings of the 2nd International Conference “Numerical Computations: Theory and Algorithms”. Author(s), 2016. http://dx.doi.org/10.1063/1.4965310.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Khimich, Alexander, Volodymyr Sydoruk i Pavlo Yershov. "Intellectualization Of Computation Based On Neural Networks For Mathematical Modeling". W 2019 IEEE International Conference on Advanced Trends in Information Theory (ATIT). IEEE, 2019. http://dx.doi.org/10.1109/atit49449.2019.9030444.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

"A Non-lineal Mathematical Model for Annealing Stainless Steel Coils". W International Conference on Neural Computation Theory and Applications. SciTePress - Science and and Technology Publications, 2012. http://dx.doi.org/10.5220/0004112206070610.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Computation Theory and Mathematics"

McCarthy, John. Mathematical Theory of Computation. Fort Belvoir, VA: Defense Technical Information Center, sierpień 1991. http://dx.doi.org/10.21236/ada239419.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Yau, Shing-Tung. Mathematics and string theory. Office of Scientific and Technical Information (OSTI), listopad 2002. http://dx.doi.org/10.2172/809056.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Jaffe, A., i Shing-Tung Yau. [Mathematics and string theory]. Office of Scientific and Technical Information (OSTI), styczeń 1993. http://dx.doi.org/10.2172/6327345.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Jaffe, A., S. Klimek, B. Greene i S.-T. Yau. (Mathematics and string theory). Office of Scientific and Technical Information (OSTI), styczeń 1989. http://dx.doi.org/10.2172/5148870.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Greenberg, W., i P. Zweifel. Applied mathematics of transport theory. Office of Scientific and Technical Information (OSTI), maj 1990. http://dx.doi.org/10.2172/6703991.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Schreiber, Robert, i Beresford Parlett. Block Reflectors: Theory and Computation. Fort Belvoir, VA: Defense Technical Information Center, maj 1987. http://dx.doi.org/10.21236/ada206861.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Gidaspow, D. Computation of hydrodynamics using kinetic theory. Office of Scientific and Technical Information (OSTI), grudzień 1991. http://dx.doi.org/10.2172/5686161.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Robinson, Stephen M. Computation and Theory in Nonlinear Optimization. Fort Belvoir, VA: Defense Technical Information Center, kwiecień 1996. http://dx.doi.org/10.21236/ada311415.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Hoffman, D. [Geometry, analysis, and computation in mathematics and applied science]. Progress report. Office of Scientific and Technical Information (OSTI), luty 1994. http://dx.doi.org/10.2172/218245.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Kusner, R. B., D. A. Hoffman, P. Norman, F. Pedit, N. Whitaker i D. Oliver. Geometry, analysis, and computation in mathematics and applied sciences. Final report. Office of Scientific and Technical Information (OSTI), grudzień 1995. http://dx.doi.org/10.2172/171332.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!