Relevant bibliographies by topics / Iterators

Contents

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

Academic literature on the topic 'Iterators'

Author: Grafiati
Published: 25 May 2024

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.

Journal articles on the topic "Iterators"

1

Baker, Henry G. "Iterators." ACM SIGPLAN OOPS Messenger 4, no. 3 (July 1993): 18–25. http://dx.doi.org/10.1145/165507.165514.

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

Liu, Jed, Aaron Kimball, and Andrew C. Myers. "Interruptible iterators." ACM SIGPLAN Notices 41, no. 1 (January 12, 2006): 283–94. http://dx.doi.org/10.1145/1111320.1111063.

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

Lamb, D. A. "Specification of iterators." IEEE Transactions on Software Engineering 16, no. 12 (1990): 1352–60. http://dx.doi.org/10.1109/32.62444.

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

Castagna, Giuseppe, and Kim Nguyen. "Typed iterators for XML." ACM SIGPLAN Notices 43, no. 9 (September 27, 2008): 15–26. http://dx.doi.org/10.1145/1411203.1411210.

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

MESSERSCHMIDT, H. J. "List Iterators in C++." Software: Practice and Experience 26, no. 11 (November 1996): 1197–203. http://dx.doi.org/10.1002/(sici)1097-024x(199611)26:11<1197::aid-spe55>3.0.co;2-l.

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

Haack, Christian, and Clément Hurlin. "Resource Usage Protocols for Iterators." Journal of Object Technology 8, no. 4 (2009): 55. http://dx.doi.org/10.5381/jot.2009.8.4.a3.

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

Coyle, Christopher, and Peter Crogono. "Building abstract iterators using continuations." ACM SIGPLAN Notices 26, no. 2 (January 2, 1991): 17–24. http://dx.doi.org/10.1145/122179.122181.

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

Rayside, Derek, Vajihollah Montaghami, Francesca Leung, Albert Yuen, Kevin Xu, and Daniel Jackson. "Synthesizing iterators from abstraction functions." ACM SIGPLAN Notices 48, no. 3 (April 10, 2013): 31–40. http://dx.doi.org/10.1145/2480361.2371407.

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

Zhang, Wei, Per Larsen, Stefan Brunthaler, and Michael Franz. "Accelerating iterators in optimizing AST interpreters." ACM SIGPLAN Notices 49, no. 10 (December 31, 2014): 727–43. http://dx.doi.org/10.1145/2714064.2660223.

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

Bergstra, Jan A., and Alban Ponse. "Non-regular iterators in process algebra." Theoretical Computer Science 269, no. 1-2 (October 2001): 203–29. http://dx.doi.org/10.1016/s0304-3975(00)00413-8.

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

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.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 143-146).
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 atomically updates program state for each unit. Filtered iterators can greatly simplify the development of robust programs. We formally define filtered iterators in RIFL. The semantics of filtered iterators ensure that each input unit affects program execution atomically. Our benchmarks show that using filtered iterators reduces an average of 41.7% lines of code, or 58.5% conditional clauses and 33.4% unconditional computation, from fully manual implementations.
by Jiasi Shen.
S.M.
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 inefficient, costly to maintain, and a risk to security. This thesis proposes methods to leverage the expertise put in the development of legacy code and to extend its useful lifespan, rather than to throw it away. A novel methodology is proposed, for automatically exploiting platform specific optimisations when retargeting a program to another platform. The key idea is to leverage the optimisation information embedded in vector processing intrinsic functions. The performance of the resulting code is shown to be close to the performance of manually retargeted programs, however with the human labour removed. Building on top of that, the question of discovering optimisation information when there are no hints in the form of intrinsics or annotations is investigated. This thesis postulates that such information can potentially be extracted from profiling the data flow during executions of the program. A context-aware data dependence profiling system is described, detailing previously overlooked aspects in related research. The system is shown to be essential in surpassing the information that can be inferred statically, in particular about loop iterators. Loop iterators are the controlling part of a loop. This thesis describes and evaluates a system for extracting the loop iterators in a program. It is found to significantly outperform previously known techniques and further increases the amount of information about the structure of a program that is available to a compiler. Combining this system with data dependence profiling improves its results even more. Loop iterator recognition enables other code modernising techniques, like source code rejuvenation and commutativity analysis. The former increases the use of idiomatic code and as a result increases the maintainability of the program. The latter can potentially drive parallelisation and thus dramatically improve runtime performance.
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 théorique de l'approche proposé dans cette thèse est d'utiliser une notion de prophétie qui permet d'interpréter les emprunts mutables du langage Rust en une valeur courante et une valeur future cet emprunt. L'assistant de preuve Coq a été utilisé pour formaliser cet encodage prophétique et prouver la correction de la génération d'obligation de preuves associée. Par ailleurs l'approche a été mise en œuvre dans une implémentation d'un logiciel de vérification pour Rust qui automatise la génération des obligations de preuve et fait appel à des solveurs externes pour valider ces obligations. Afin de supporter les itérateurs de Rust, une extension a été développée pour manipuler les clôtures ainsi qu'une technique de vérification pour les itérateurs et combinateurs. L'implémentation a été évaluée expérimentalement sur des exemples d'algorithmes et structures de données pertinentes. Elle a été également validée par une étude de cas conséquente: la vérification d'un solveur de satisfiabilité modulo theories (SMT)
Rust is a programming language introduced in 2015, which provides the programmer with safety features regarding the use of memory. The goal of this thesis is the development of a deductive verification tool for the Rust language, by leveraging the specificities of its type system, in order to simplify memory aliasing management, among other things. Such a verification approach ensures the absence of errors during the execution of the considered programs, as well as their compliance with a formal specification of the expected functional behavior. The theoretical foundation of the approach proposed in this thesis is to use a notion of prophecy that interprets the mutable borrows in the Rust language as a current value and a future value of this borrow. The Coq proof assistant was used to formalize this prophetic encoding and prove the correctness of the associated proof obligation generation. Furthermore, the approach has been implemented in a verification software for Rust that automates the generation of proof obligations and relies on external solvers to validate these obligations. In order to support Rust iterators, an extension has been developed to manipulate closures, as well as a verification technique for iterators and combinators. The implementation has been experimentally evaluated on relevant algorithm and data structure examples. It has also been validated through a significant case study: the verification of a satisfiability modulo theories (SMT) solver
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 har värderats. Några exempel på dessa förutsättningar är antalet arbetstrådar som arbetar mot kön, initial storlek hos kön samt olika pinning strategier. Initial storlek beskriver hur många element som befinner sig i kön vid experimentens start och pinning strategi beskriver vilken kärna varje tråd skall binda sig till. Vissa iterator algoritmer lämnar garantier för att det tillstånd som returneras är ett atomiskt snapshot av kön. Ett atomiskt snapshot är en ögonblicksbild av hur kön såg ut vid någon fast tidpunkt. På grund av detta har det även varit ett mål att mäta hur stor kostnaden är för att få denna garanti. Utöver detta har prestandan hos enqueue och dequeue operationerna för respektive kö testats för att få en helhetsblick över köns prestanda.För att mäta prestandan har ett benchmarkprogram implementerats. Detta benchmarkprogram förser ett gränssnitt för samtliga köer att implementera, och kan utefter detta gränssnitt testa prestandan hos kön. Programmet kör mikrobenchmarks som mäter prestandan hos varje enskild operation hos kön. Det sätt som kön pressas på under dessa benchmarks är inte realistiskt för hur kön kan tänkas användas i skarpt läge. Istället mäts prestandan vid högsta möjliga belastning. Detta görs för att enklast kunna jämföra prestandan mellan de olika köerna.I studien har prestandan hos fyra köer med iteratorer testats, experimenten är utförda i C# med .NET 4.5 i en Windows miljö. Den parallella kö som finns i .NET biblioteket var en av köerna som testades. Dels för att det är intressant att se hur väl Microsoft optimerat denna, men också för att få en utgångspunkt att jämföra med de andra testade köerna. Michael och Scotts kö har även den testats, med två stycken olika iteratorer tillagda. Dessa är Scan and Return och Double Collect. Även en parallell kö framtagen med hjälp av universella metoder för att konstruera paralllella dataobjekt från sekventiella, baserad på den immutable kö som finns i .NET biblioteket har testats. En immutable kö är en kö som inte kan modifieras efter initiering.Resultaten från utförda benchmarks visar att Michael och Scott kön med Scan and Return iteratorn är den snabbaste på iteration, med Double Collect iteratorn som tvåa. Snabbast enqueue och dequeue operationer hittas i .NET bibliotekets parallella kö. Kön som bygger på immutable visar sig vara långsammast vad gäller iteration i de flesta fall. Den är även långsammast vad gäller enqueue och dequeue operationerna i samtliga fall. Kostnaden för att få en garanti för ett atomiskt snaphot mäter vi i skillnaden mellan Scan and Return och Double Collect iteratorerna. Detta på grund av att dessa är de två snabbaste iteratorerna och Scan and Return inte lämnar garantin medan Double Collect gör det. Denna kostnad visar sig vara relativt stor, Scan and Return presterar upp emot tre gånger så snabbt som Double Collect.Med hjälp av resultaten från denna studie kan nu utvecklare göra väl informerade val vad gäller vilken kö med iterator algoritm de skall välja för att optimera sina system. Detta kanske är som viktigast vid utveckling av större system, men kan även vara användbart vid mindre.
Program: Systemarkitekturutbildningen
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 constructed also for a P-Neumann problem in D.
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 erratique et la presence de divisions par zero est problematique. Des methodes prevoyantes de traitement de ces situations appelees arrets apportent une solution a ce dernier phenomene. En arithmetique a virgule flottante, les criteres de detections des arrets ne sont pas adaptes du fait de leur nature a priori. Avec l'arithmetique stochastique discrete, ils sont choisis de maniere dynamique. Pour les grands systemes, ces situations sont rares et il est preferable de redemarrer l'algorithme lorsque les variables de la recurrence n'ont plus de chiffres significatifs. Pour les methodes avec de longues relations de recurrence de type gmres, la principale preoccupation est de trouver une frequence de redemarrage convenable pour assurer la convergence en un temps raisonnable et limiter le stockage en memoire. De nombreuses techniques a priori existent sans toutefois se reveler ideales. Nous proposons une strategie de redemarrage dynamique et etudions son interet suivant les differents schemas d'orthogonalisation. La qualite numerique est d'autant plus importante dans une approche parallele que le nombre d'operations effectuees est souvent plus eleve que sur des machines sequentielles. Nous expliquons donc la realisation de l'interface entre les librairies cadna et mpi qui nous permet de generaliser nos travaux sur des architectures paralleles mimd pour une programmation spmd.
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

Books on the topic "Iterators"

1

Iterature. Brooklyn: Ugly Duckling Presse, 2005.

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

Ostashevsky, Eugene. Iterature. [s.l.]: Ugly Duckling Presse, 2004.

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

Robert, François. Discrete Iterations. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/978-3-642-61607-5.

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

Robert, François. Discrete iterations: Ametric study. Berlin: Springer-Verlag, 1986.

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

Babin, A. V. Iterations of differential operators. New York: Gordon and Breach Science Publishers, 1989.

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

Iterations of the diagonal. Toronto, ON: Shuffaloff, 1995.

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

Timothy, Druckrey, Stainback Charles 1952-, and International Center of Photography, eds. Iterations: The new image. New York City: International Center of Photography, 1993.

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

Leader, Jeffery J. Boundedness and asymptotics of the Generalized Theodorus Iteration. Monterey, Calif: Naval Postgraduate School, 1993.

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

Scandrett, Clyde. Comparison of several iterative techniques in the solution of symmetric banded equations on a two-pipe Cyber 205. Monterey, Calif: Naval Postgraduate School, 1988.

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

United States. National Aeronautics and Space Administration., ed. Spectrum transformation for divergent iterations. [Washington, DC]: National Aeronautics and Space Administration, 1991.

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

Book chapters on the topic "Iterators"

1

Lischner, Ray. "Iterators." In Exploring C++ 11, 315–24. Berkeley, CA: Apress, 2013. http://dx.doi.org/10.1007/978-1-4302-6194-0_44.

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

Robson, Robert. "Iterators." In Using the STL, 24–46. New York, NY: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4684-0531-6_2.

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

Seamark, Philip, and Thomas Martens. "Iterators." In Pro DAX with Power BI, 119–44. Berkeley, CA: Apress, 2019. http://dx.doi.org/10.1007/978-1-4842-4897-3_6.

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

Aspin, Adam. "Iterators." In Pro DAX and Data Modeling in Power BI, 275–303. Berkeley, CA: Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-8995-2_12.

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

Robson, Robert. "Iterators." In Using the STL, 29–62. New York, NY: Springer New York, 2000. http://dx.doi.org/10.1007/978-1-4612-1312-3_2.

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

Lischner, Ray. "Using Iterators." In Exploring C++20, 153–58. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5961-0_23.

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

Milanesi, Carlo. "Using Iterators." In Beginning Rust, 197–221. Berkeley, CA: Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3468-6_16.

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

Pilgrim, Mark. "Advanced Iterators." In Dive Into Python 3, 113–30. Berkeley, CA: Apress, 2009. http://dx.doi.org/10.1007/978-1-4302-2416-7_8.

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

Milanesi, Carlo. "Using Iterators." In Beginning Rust, 217–42. Berkeley, CA: Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-7208-4_16.

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

Lischner, Ray. "More About Iterators." In Exploring C++20, 341–50. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5961-0_46.

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

Conference papers on the topic "Iterators"

1

Liu, Jed, Aaron Kimball, and Andrew C. Myers. "Interruptible iterators." In Conference record of the 33rd ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1111037.1111063.

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

Filliâtre, Jean-Christophe. "Backtracking iterators." In the 2006 workshop. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1159876.1159885.

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

Joyner, M., B. L. Chamberlain, and S. J. Deitz. "Iterators in Chapel." In Proceedings 20th IEEE International Parallel & Distributed Processing Symposium. IEEE, 2006. http://dx.doi.org/10.1109/ipdps.2006.1639499.

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

Castagna, Giuseppe, and Kim Nguyen. "Typed iterators for XML." In Proceeding of the 13th ACM SIGPLAN international conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1411204.1411210.

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

Rayside, Derek, Vajihollah Montaghami, Francesca Leung, Albert Yuen, Kevin Xu, and Daniel Jackson. "Synthesizing iterators from abstraction functions." In the 11th International Conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2371401.2371407.

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

Shen, Jiasi, and Martin Rinard. "Robust programs with filtered iterators." In SPLASH '17: Conference on Systems, Programming, Languages, and Applications: Software for Humanity. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3136014.3136030.

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

Langr, Daniel, Ivan Šimeček, and Tomáš Dytrych. "Block Iterators for Sparse Matrices." In 2016 Federated Conference on Computer Science and Information Systems. IEEE, 2016. http://dx.doi.org/10.15439/2016f35.

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

Zhang, Wei, Per Larsen, Stefan Brunthaler, and Michael Franz. "Accelerating iterators in optimizing AST interpreters." In SPLASH '14: Conference on Systems, Programming, and Applications: Software for Humanity. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2660193.2660223.

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

Krishnaswami, Neelakantan R. "Reasoning about iterators with separation logic." In the 2006 conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1181195.1181213.

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

Brock, Benjamin, Scott McMillan, Aydin Buluc, Timothy G. Mattson, and Jose E. Moreira. "GraphBLAS: C++ Iterators for Sparse Matrices." In 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2022. http://dx.doi.org/10.1109/ipdpsw55747.2022.00053.

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

Reports on the topic "Iterators"

1

Hahn, Kim, and Ja Young Hwang. Helical Iterations. Ames: Iowa State University, Digital Repository, September 2016. http://dx.doi.org/10.31274/itaa_proceedings-180814-1601.

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

Marchesini, Stefano. Phase retrieval by power iterations. Office of Scientific and Technical Information (OSTI), October 2012. http://dx.doi.org/10.2172/1172721.

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

Yao, Jen-Chih. Fixed points by Ishikawa iterations. Office of Scientific and Technical Information (OSTI), December 1989. http://dx.doi.org/10.2172/5213436.

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

Walker, Homer F. Anderson Acceleration for Fixed-Point Iterations. Office of Scientific and Technical Information (OSTI), August 2015. http://dx.doi.org/10.2172/1240289.

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

Younes, W., and D. Gogny. FRANCHFRI: the Finite-RANge Constrained Hartree-Fock Rapid Iterator. Office of Scientific and Technical Information (OSTI), January 2007. http://dx.doi.org/10.2172/902336.

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

Raftery, Adrian E., and Steven Lewis. How Many Iterations in the Gibbs Sampler? Fort Belvoir, VA: Defense Technical Information Center, September 1991. http://dx.doi.org/10.21236/ada640705.

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

Leader, Jeffery J. Power Iterations and the Dominant Eigenvalue Problem. Fort Belvoir, VA: Defense Technical Information Center, December 1992. http://dx.doi.org/10.21236/ada261695.

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

Elman, Howard, and David Silvester. Fast Nonsymmetric Iterations and Preconditioning for Navier-Stokes Equations. Fort Belvoir, VA: Defense Technical Information Center, June 1994. http://dx.doi.org/10.21236/ada599710.

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

Sezer, Sefa A., and Ibrahim Çanak. Tauberian Remainder Theorems for Iterations of Methods of Weighted Means. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, February 2019. http://dx.doi.org/10.7546/crabs.2019.01.01.

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

Yao, Jen-Chih. On mean value iterations with application to variational inequality problems. Office of Scientific and Technical Information (OSTI), December 1989. http://dx.doi.org/10.2172/5173143.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Iterators' 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