Gotowa bibliografia na temat „Iterators”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Iterators”.
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 "Iterators"
Baker, Henry G. "Iterators". ACM SIGPLAN OOPS Messenger 4, nr 3 (lipiec 1993): 18–25. http://dx.doi.org/10.1145/165507.165514.
Pełny tekst źródłaLiu, Jed, Aaron Kimball i Andrew C. Myers. "Interruptible iterators". ACM SIGPLAN Notices 41, nr 1 (12.01.2006): 283–94. http://dx.doi.org/10.1145/1111320.1111063.
Pełny tekst źródłaLamb, D. A. "Specification of iterators". IEEE Transactions on Software Engineering 16, nr 12 (1990): 1352–60. http://dx.doi.org/10.1109/32.62444.
Pełny tekst źródłaCastagna, Giuseppe, i Kim Nguyen. "Typed iterators for XML". ACM SIGPLAN Notices 43, nr 9 (27.09.2008): 15–26. http://dx.doi.org/10.1145/1411203.1411210.
Pełny tekst źródłaMESSERSCHMIDT, H. J. "List Iterators in C++". Software: Practice and Experience 26, nr 11 (listopad 1996): 1197–203. http://dx.doi.org/10.1002/(sici)1097-024x(199611)26:11<1197::aid-spe55>3.0.co;2-l.
Pełny tekst źródłaHaack, Christian, i Clément Hurlin. "Resource Usage Protocols for Iterators." Journal of Object Technology 8, nr 4 (2009): 55. http://dx.doi.org/10.5381/jot.2009.8.4.a3.
Pełny tekst źródłaCoyle, Christopher, i Peter Crogono. "Building abstract iterators using continuations". ACM SIGPLAN Notices 26, nr 2 (2.01.1991): 17–24. http://dx.doi.org/10.1145/122179.122181.
Pełny tekst źródłaRayside, Derek, Vajihollah Montaghami, Francesca Leung, Albert Yuen, Kevin Xu i Daniel Jackson. "Synthesizing iterators from abstraction functions". ACM SIGPLAN Notices 48, nr 3 (10.04.2013): 31–40. http://dx.doi.org/10.1145/2480361.2371407.
Pełny tekst źródłaZhang, Wei, Per Larsen, Stefan Brunthaler i Michael Franz. "Accelerating iterators in optimizing AST interpreters". ACM SIGPLAN Notices 49, nr 10 (31.12.2014): 727–43. http://dx.doi.org/10.1145/2714064.2660223.
Pełny tekst źródłaBergstra, Jan A., i Alban Ponse. "Non-regular iterators in process algebra". Theoretical Computer Science 269, nr 1-2 (październik 2001): 203–29. http://dx.doi.org/10.1016/s0304-3975(00)00413-8.
Pełny tekst źródłaRozprawy doktorskie na temat "Iterators"
Shen, Jiasi. "RIFL : a language with filtered iterators". Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/101587.
Pełny tekst źródłaCataloged 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.
Manilov, Stanislav Zapryanov. "Analysis and transformation of legacy code". Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/29612.
Pełny tekst źródłaDenis, Xavier. "Deductive verification of Rust programs". Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG101.
Pełny tekst źródłaRust 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
Galbraith, Steven Douglas. "Iterations of elliptic curves". Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/28620.
Pełny tekst źródłaLodin, Viktor, i 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.
Pełny tekst źródłaProgram: Systemarkitekturutbildningen
Shlapunov, Alexander. "On Iterations of double layer potentials". Universität Potsdam, 2000. http://opus.kobv.de/ubp/volltexte/2008/2568/.
Pełny tekst źródłaSchrader, U. "Convergence of Asynchronous Jacobi-Newton-Iterations". Universitätsbibliothek Chemnitz, 1998. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199801324.
Pełny tekst źródłaTorshage, 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.
Pełny tekst źródłaMONTAGNAC, MARC. "Controle dynamique d'algorithmes iteratifs de resolution de systemes lineaires". Paris 6, 1999. http://www.theses.fr/1999PA066351.
Pełny tekst źródłaStumpo, Gordon. "Design Iterations Through Fusion of Additive and Subtractive Design". Kent State University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=kent1461602511.
Pełny tekst źródłaKsiążki na temat "Iterators"
Iterature. Brooklyn: Ugly Duckling Presse, 2005.
Znajdź pełny tekst źródłaOstashevsky, Eugene. Iterature. [s.l.]: Ugly Duckling Presse, 2004.
Znajdź pełny tekst źródłaRobert, François. Discrete Iterations. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/978-3-642-61607-5.
Pełny tekst źródłaRobert, François. Discrete iterations: Ametric study. Berlin: Springer-Verlag, 1986.
Znajdź pełny tekst źródłaBabin, A. V. Iterations of differential operators. New York: Gordon and Breach Science Publishers, 1989.
Znajdź pełny tekst źródłaIterations of the diagonal. Toronto, ON: Shuffaloff, 1995.
Znajdź pełny tekst źródłaTimothy, Druckrey, Stainback Charles 1952- i International Center of Photography, red. Iterations: The new image. New York City: International Center of Photography, 1993.
Znajdź pełny tekst źródłaLeader, Jeffery J. Boundedness and asymptotics of the Generalized Theodorus Iteration. Monterey, Calif: Naval Postgraduate School, 1993.
Znajdź pełny tekst źródłaScandrett, 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.
Znajdź pełny tekst źródłaUnited States. National Aeronautics and Space Administration., red. Spectrum transformation for divergent iterations. [Washington, DC]: National Aeronautics and Space Administration, 1991.
Znajdź pełny tekst źródłaCzęści książek na temat "Iterators"
Lischner, Ray. "Iterators". W Exploring C++ 11, 315–24. Berkeley, CA: Apress, 2013. http://dx.doi.org/10.1007/978-1-4302-6194-0_44.
Pełny tekst źródłaRobson, Robert. "Iterators". W Using the STL, 24–46. New York, NY: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4684-0531-6_2.
Pełny tekst źródłaSeamark, Philip, i Thomas Martens. "Iterators". W Pro DAX with Power BI, 119–44. Berkeley, CA: Apress, 2019. http://dx.doi.org/10.1007/978-1-4842-4897-3_6.
Pełny tekst źródłaAspin, Adam. "Iterators". W 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.
Pełny tekst źródłaRobson, Robert. "Iterators". W Using the STL, 29–62. New York, NY: Springer New York, 2000. http://dx.doi.org/10.1007/978-1-4612-1312-3_2.
Pełny tekst źródłaLischner, Ray. "Using Iterators". W Exploring C++20, 153–58. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5961-0_23.
Pełny tekst źródłaMilanesi, Carlo. "Using Iterators". W Beginning Rust, 197–221. Berkeley, CA: Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3468-6_16.
Pełny tekst źródłaPilgrim, Mark. "Advanced Iterators". W Dive Into Python 3, 113–30. Berkeley, CA: Apress, 2009. http://dx.doi.org/10.1007/978-1-4302-2416-7_8.
Pełny tekst źródłaMilanesi, Carlo. "Using Iterators". W Beginning Rust, 217–42. Berkeley, CA: Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-7208-4_16.
Pełny tekst źródłaLischner, Ray. "More About Iterators". W Exploring C++20, 341–50. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5961-0_46.
Pełny tekst źródłaStreszczenia konferencji na temat "Iterators"
Liu, Jed, Aaron Kimball i Andrew C. Myers. "Interruptible iterators". W 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.
Pełny tekst źródłaFilliâtre, Jean-Christophe. "Backtracking iterators". W the 2006 workshop. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1159876.1159885.
Pełny tekst źródłaJoyner, M., B. L. Chamberlain i S. J. Deitz. "Iterators in Chapel". W Proceedings 20th IEEE International Parallel & Distributed Processing Symposium. IEEE, 2006. http://dx.doi.org/10.1109/ipdps.2006.1639499.
Pełny tekst źródłaCastagna, Giuseppe, i Kim Nguyen. "Typed iterators for XML". W Proceeding of the 13th ACM SIGPLAN international conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1411204.1411210.
Pełny tekst źródłaRayside, Derek, Vajihollah Montaghami, Francesca Leung, Albert Yuen, Kevin Xu i Daniel Jackson. "Synthesizing iterators from abstraction functions". W the 11th International Conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2371401.2371407.
Pełny tekst źródłaShen, Jiasi, i Martin Rinard. "Robust programs with filtered iterators". W 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.
Pełny tekst źródłaLangr, Daniel, Ivan Šimeček i Tomáš Dytrych. "Block Iterators for Sparse Matrices". W 2016 Federated Conference on Computer Science and Information Systems. IEEE, 2016. http://dx.doi.org/10.15439/2016f35.
Pełny tekst źródłaZhang, Wei, Per Larsen, Stefan Brunthaler i Michael Franz. "Accelerating iterators in optimizing AST interpreters". W 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.
Pełny tekst źródłaKrishnaswami, Neelakantan R. "Reasoning about iterators with separation logic". W the 2006 conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1181195.1181213.
Pełny tekst źródłaBrock, Benjamin, Scott McMillan, Aydin Buluc, Timothy G. Mattson i Jose E. Moreira. "GraphBLAS: C++ Iterators for Sparse Matrices". W 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2022. http://dx.doi.org/10.1109/ipdpsw55747.2022.00053.
Pełny tekst źródłaRaporty organizacyjne na temat "Iterators"
Hahn, Kim, i Ja Young Hwang. Helical Iterations. Ames: Iowa State University, Digital Repository, wrzesień 2016. http://dx.doi.org/10.31274/itaa_proceedings-180814-1601.
Pełny tekst źródłaMarchesini, Stefano. Phase retrieval by power iterations. Office of Scientific and Technical Information (OSTI), październik 2012. http://dx.doi.org/10.2172/1172721.
Pełny tekst źródłaYao, Jen-Chih. Fixed points by Ishikawa iterations. Office of Scientific and Technical Information (OSTI), grudzień 1989. http://dx.doi.org/10.2172/5213436.
Pełny tekst źródłaWalker, Homer F. Anderson Acceleration for Fixed-Point Iterations. Office of Scientific and Technical Information (OSTI), sierpień 2015. http://dx.doi.org/10.2172/1240289.
Pełny tekst źródłaYounes, W., i D. Gogny. FRANCHFRI: the Finite-RANge Constrained Hartree-Fock Rapid Iterator. Office of Scientific and Technical Information (OSTI), styczeń 2007. http://dx.doi.org/10.2172/902336.
Pełny tekst źródłaRaftery, Adrian E., i Steven Lewis. How Many Iterations in the Gibbs Sampler? Fort Belvoir, VA: Defense Technical Information Center, wrzesień 1991. http://dx.doi.org/10.21236/ada640705.
Pełny tekst źródłaLeader, Jeffery J. Power Iterations and the Dominant Eigenvalue Problem. Fort Belvoir, VA: Defense Technical Information Center, grudzień 1992. http://dx.doi.org/10.21236/ada261695.
Pełny tekst źródłaElman, Howard, i David Silvester. Fast Nonsymmetric Iterations and Preconditioning for Navier-Stokes Equations. Fort Belvoir, VA: Defense Technical Information Center, czerwiec 1994. http://dx.doi.org/10.21236/ada599710.
Pełny tekst źródłaSezer, Sefa A., i Ibrahim Çanak. Tauberian Remainder Theorems for Iterations of Methods of Weighted Means. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, luty 2019. http://dx.doi.org/10.7546/crabs.2019.01.01.
Pełny tekst źródłaYao, Jen-Chih. On mean value iterations with application to variational inequality problems. Office of Scientific and Technical Information (OSTI), grudzień 1989. http://dx.doi.org/10.2172/5173143.
Pełny tekst źródła