Academic literature on the topic 'Iterators'

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 'Iterators.'

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.

Dissertations / Theses on the topic "Iterators"

1

Shen, Jiasi. "RIFL : a language with filtered iterators." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/101587.

Full text
Abstract:
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 143-146).<br>RIFL is a new programming language that enables developers to write only common-case code to robustly process structured inputs. RIFL eliminates the need to manually handle errors with a new control structure, filtered iterators. A filtered iterator treats inputs as collections of input units, iterates over the units, uses the program itself to filter out unanticipated units, and
APA, Harvard, Vancouver, ISO, and other styles
2

Manilov, Stanislav Zapryanov. "Analysis and transformation of legacy code." Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/29612.

Full text
Abstract:
Hardware evolves faster than software. While a hardware system might need replacement every one to five years, the average lifespan of a software system is a decade, with some instances living up to several decades. Inevitably, code outlives the platform it was developed for and may become legacy: development of the software stops, but maintenance has to continue to keep up with the evolving ecosystem. No new features are added, but the software is still used to fulfil its original purpose. Even in the cases where it is still functional (which discourages its replacement), legacy code is ineff
APA, Harvard, Vancouver, ISO, and other styles
3

Denis, Xavier. "Deductive verification of Rust programs." Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG101.

Full text
Abstract:
Rust est un langage de programmation introduit en 2015, qui apporte au programmeur des éléments de sûreté concernant l'utilisation de la mémoire. Le but de cette thèse est le développement d'un outil de vérification déductive pour le langage Rust, en exploitant les spécificités de son système de types afin notamment de simplifier la gestion de l'aliasing mémoire. Une telle approche de vérification permet de s'assurer de l'absence d'erreurs à l'exécution des programmes considérés, ainsi que leur conformité vis-a-vis d'une spécification formelle du comportement fonctionnel attendu. Le fondement
APA, Harvard, Vancouver, ISO, and other styles
4

Galbraith, Steven Douglas. "Iterations of elliptic curves." Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/28620.

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

Lodin, Viktor, and Magnus Olovsson. "Prestanda- och beteendeanalys av parallella köer med iterator." Thesis, Högskolan i Borås, Institutionen Handels- och IT-högskolan, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-17770.

Full text
Abstract:
I modern utveckling av hårdvara ligger det stort fokus på att producera processorer med fler och fler kärnor. Därmed behöver även mjukvaran utvecklas för att på bästa sätt utnyttja all denna parallella potential. En stor del av detta är då att kunna dela data mellan flera parallella processer, vilket uppnås med hjälp av parallella samlingsdatatyper. En vanlig operation på samlingsdatatyper är att iterera denna. Studiens mål var att analysera prestanda och beteende hos ett flertal kända algoritmer för iteration av datasamlingen kö. Även hur olika förutsättningar kan påverka iteratorns prestanda
APA, Harvard, Vancouver, ISO, and other styles
6

Shlapunov, Alexander. "On Iterations of double layer potentials." Universität Potsdam, 2000. http://opus.kobv.de/ubp/volltexte/2008/2568/.

Full text
Abstract:
We prove the existence of Hp(D)-limit of iterations of double layer potentials constructed with the use of Hodge parametrix on a smooth compact manifold X, D being an open connected subset of X. This limit gives us an orthogonal projection from Sobolev space Hp(D) to a closed subspace of Hp(D)-solutions of an elliptic operator P of order p ≥ 1. Using this result we obtain formulae for Sobolev solutions to the equation Pu = f in D whenever these solutions exist. This representation involves the sum of a series whose terms are iterations of double layer potentials. Similar regularization is cons
APA, Harvard, Vancouver, ISO, and other styles
7

Schrader, U. "Convergence of Asynchronous Jacobi-Newton-Iterations." Universitätsbibliothek Chemnitz, 1998. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199801324.

Full text
Abstract:
Asynchronous iterations often converge under different conditions than their syn- chronous counterparts. In this paper we will study the global convergence of Jacobi- Newton-like methods for nonlinear equationsF x = 0. It is a known fact, that the synchronous algorithm converges monotonically, ifF is a convex M-function and the starting valuesx0 andy0 meet the conditionF x04 04F y0 . In the paper it will be shown, which modifications are necessary to guarantee a similar convergence behavior for an asynchronous computation.
APA, Harvard, Vancouver, ISO, and other styles
8

Torshage, Axel. "Linear Functional Equations and Convergence of Iterates." Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-56450.

Full text
Abstract:
The subject of this work is functional equations with direction towards linear functional equations. The .rst part describes function sets where iterates of the functions converge to a .xed point. In the second part the convergence property is used to provide solutions to linear functional equations by de.ning solutions as in.nite sums. Furthermore, this work contains some transforms to linear form, examples of functions that belong to di¤erent classes and corresponding linear functional equations. We use Mathematica to generate solutions and solve itera- tively equations.
APA, Harvard, Vancouver, ISO, and other styles
9

MONTAGNAC, MARC. "Controle dynamique d'algorithmes iteratifs de resolution de systemes lineaires." Paris 6, 1999. http://www.theses.fr/1999PA066351.

Full text
Abstract:
Cette these presente la resolution de systemes lineaires par des methodes de type krylov avec l'utilisation de l'arithmetique stochastique discrete. Cette arithmetique permet de prendre en compte la propagation des erreurs d'arrondi de calcul par une approche probabiliste et d'estimer la precision numerique des variables au sein d'un algorithme. Notre objectif est de rendre ces methodes plus robustes et efficaces a l'aide de strategies informatiques dynamiques tout en exercant une validation numerique des resultats. Pour les methodes de type lanczos, bicgstab et cgs, la convergence est souvent
APA, Harvard, Vancouver, ISO, and other styles
10

Stumpo, Gordon. "Design Iterations Through Fusion of Additive and Subtractive Design." Kent State University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=kent1461602511.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources
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!