Добірка наукової літератури з теми "080201 Analysis of Algorithms and Complexity"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "080201 Analysis of Algorithms and Complexity".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "080201 Analysis of Algorithms and Complexity"
Hower, Walter. "Constraint satisfaction — Algorithms and complexity analysis." Information Processing Letters 55, no. 3 (August 1995): 171–78. http://dx.doi.org/10.1016/0020-0190(95)00089-u.
Повний текст джерелаBARMAK, OLEXANDER, PAVLO RADIUK, MARYNA MOLCHANOVA, and OLENA SOBKO. "APPROACHES TO PRACTICAL ANALYSIS OF COMPUTING ALGORITHMS." Herald of Khmelnytskyi National University 303, no. 6 (December 2021): 102–5. http://dx.doi.org/10.31891/2307-5732-2021-303-6-102-105.
Повний текст джерелаChen, Xinjia, Kemin Zhou, and Jorge Aravena. "Probabilistic Robustness Analysis—Risks, Complexity, and Algorithms." SIAM Journal on Control and Optimization 47, no. 5 (January 2008): 2693–723. http://dx.doi.org/10.1137/060668407.
Повний текст джерелаHagiya, Masami, John A. Rose, Ken Komiya, and Kensaku Sakamoto. "Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms." Theoretical Computer Science 287, no. 1 (September 2002): 59–71. http://dx.doi.org/10.1016/s0304-3975(02)00095-6.
Повний текст джерелаFaran, Rachel, and Orna Kupferman. "A Parametrized Analysis of Algorithms on Hierarchical Graphs." International Journal of Foundations of Computer Science 30, no. 06n07 (September 2019): 979–1003. http://dx.doi.org/10.1142/s0129054119400252.
Повний текст джерелаDouglas, B. L., and J. B. Wang. "Complexity Analysis of Quantum Walk Based Search Algorithms." Journal of Computational and Theoretical Nanoscience 10, no. 7 (July 1, 2013): 1601–5. http://dx.doi.org/10.1166/jctn.2013.3095.
Повний текст джерелаLin, M. S., M. S. Chang, and D. J. Chen. "Distributed-program reliability analysis: complexity and efficient algorithms." IEEE Transactions on Reliability 48, no. 1 (March 1999): 87–95. http://dx.doi.org/10.1109/24.765932.
Повний текст джерелаZakarauskas, P., and J. M. Ozard. "Complexity analysis for partitioning nearest neighbor searching algorithms." IEEE Transactions on Pattern Analysis and Machine Intelligence 18, no. 6 (June 1996): 663–68. http://dx.doi.org/10.1109/34.506419.
Повний текст джерелаBarik, Somsubhra, and Haris Vikalo. "Sparsity-Aware Sphere Decoding: Algorithms and Complexity Analysis." IEEE Transactions on Signal Processing 62, no. 9 (May 2014): 2212–25. http://dx.doi.org/10.1109/tsp.2014.2307836.
Повний текст джерелаJiang, Tao, Ming Li, and Paul M. B. Vitányi. "Average-case analysis of algorithms using Kolmogorov complexity." Journal of Computer Science and Technology 15, no. 5 (September 2000): 402–8. http://dx.doi.org/10.1007/bf02950402.
Повний текст джерелаДисертації з теми "080201 Analysis of Algorithms and Complexity"
Richey, Michael Bruce. "Combinatorial optimization on series-parallel graphs : algorithms and complexity." Diss., Georgia Institute of Technology, 1985. http://hdl.handle.net/1853/24542.
Повний текст джерелаNordin, Henrik, and Kevin Jouper. "Performance analysis of multithreaded sorting algorithms." Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-10404.
Повний текст джерелаCastura, Jeff. "Performance analysis and optimization of reduced complexity Low Density Parity Check decoding algorithms." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0017/MQ53426.pdf.
Повний текст джерелаPowell, David Richard 1973. "Algorithms for sequence alignment." Monash University, School of Computer Science and Software Engineering, 2001. http://arrow.monash.edu.au/hdl/1959.1/8051.
Повний текст джерелаPhilips, Petra Camilla, and petra philips@gmail com. "Data-Dependent Analysis of Learning Algorithms." The Australian National University. Research School of Information Sciences and Engineering, 2005. http://thesis.anu.edu.au./public/adt-ANU20050901.204523.
Повний текст джерелаHo, Lester Tse Wee. "Self-organising algorithms for fourth generation wireless networks and its analysis using complexity metrics." Thesis, Queen Mary, University of London, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.407388.
Повний текст джерелаKenny, Robert. "Orbit complexity and computable Markov partitions." University of Western Australia. School of Mathematics and Statistics, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0231.
Повний текст джерелаWei, Ke. "Efficient algorithms for compressed sensing and matrix completion." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:0e2e72fb-dd0c-457b-a0a5-f91c5212f5f5.
Повний текст джерелаStarrett, Dean. "Optimal Alignment of Multiple Sequence Alignments." Diss., The University of Arizona, 2008. http://hdl.handle.net/10150/194840.
Повний текст джерелаOsbild, Ralf Verfasser], та Kurt [Akademischer Betreuer] [Mehlhorn. "General analysis tool box for controlled perturbation algorithms and complexity and computation of Θ-guarded regions / Ralf Osbild. Betreuer: Kurt Mehlhorn". Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2013. http://d-nb.info/1053634994/34.
Повний текст джерелаКниги з теми "080201 Analysis of Algorithms and Complexity"
Goodwin, Roger. Algorithm complexity: Analysis and theory. 2nd ed. Norfolk, VA (P.O. Box 8235, Norfolk 23503-0235): Old Dominion Press, 1991.
Знайти повний текст джерела1939-, Steiglitz Kenneth, ed. Combinatorial optimization: Algorithms and complexity. Mineola, N.Y: Dover Publications, 1998.
Знайти повний текст джерелаAlgorithms: Their complexity and efficiency. 2nd ed. Chichester: Wiley, 1987.
Знайти повний текст джерелаBorodin, Allan. Online computation and competitive analysis. Cambridge, [Eng.]: Cambridge University Press, 1998.
Знайти повний текст джерелаAlexander, Ostermann, ed. Analysis for computer scientists: Foundations, methods, and algorithms. London: Springer-Verlag, 2011.
Знайти повний текст джерелаKuhn, Peter. Algorithms, Complexity Analysis and VLSI Architectures for MPEG-4 Motion Estimation. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4757-4474-3.
Повний текст джерелаDieter, Kratsch, and SpringerLink (Online service), eds. Exact Exponential Algorithms. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2010.
Знайти повний текст джерелаCastura, Jeff. Performance analysis and optimization of reduced complexity low density parity check decoding algorithms. Ottawa: National Library of Canada, 2000.
Знайти повний текст джерелаWassenhove, Luk N. van. Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. Fontainebleau: INSEAD, 1991.
Знайти повний текст джерелаÇela, Eranda. The Quadratic Assignment Problem: Theory and Algorithms. Boston, MA: Springer US, 1998.
Знайти повний текст джерелаЧастини книг з теми "080201 Analysis of Algorithms and Complexity"
Ausiello, Giorgio, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, and Viggo Kann. "Probabilistic analysis of approximation algorithms." In Complexity and Approximation, 287–320. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-58412-1_9.
Повний текст джерелаKozen, Dexter C. "Algorithms and Their Complexity." In The Design and Analysis of Algorithms, 3–8. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4612-4400-4_1.
Повний текст джерелаKuhn, Peter. "Complexity Analysis Methodology." In Algorithms, Complexity Analysis and VLSI Architectures for MPEG-4 Motion Estimation, 61–92. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4757-4474-3_3.
Повний текст джерелаLi, Ming, and Paul Vitányi. "Average-Case Analysis Using Kolmogorov Complexity." In Advances in Algorithms, Languages, and Complexity, 157–69. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4613-3394-4_7.
Повний текст джерелаSani, Habiba Muhammad, Ci Lei, and Daniel Neagu. "Computational Complexity Analysis of Decision Tree Algorithms." In Lecture Notes in Computer Science, 191–97. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04191-5_17.
Повний текст джерелаRazgon, Igor. "Complexity Analysis of Heuristic CSP Search Algorithms." In Lecture Notes in Computer Science, 88–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11754602_7.
Повний текст джерелаFaran, Rachel, and Orna Kupferman. "A Parametrized Analysis of Algorithms on Hierarchical Graphs." In Descriptional Complexity of Formal Systems, 114–27. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-60252-3_9.
Повний текст джерелаGrimm, José. "Complexity Analysis of Automatic Differentiation in the Hyperion Software." In Automatic Differentiation of Algorithms, 305–10. New York, NY: Springer New York, 2002. http://dx.doi.org/10.1007/978-1-4613-0075-5_36.
Повний текст джерелаLackner, Martin, and Piotr Skowron. "Algorithms and Computational Complexity." In SpringerBriefs in Intelligent Systems, 79–93. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09016-5_5.
Повний текст джерелаAvanzini, Martin, Georg Moser, and Michael Schaper. "TcT: Tyrolean Complexity Tool." In Tools and Algorithms for the Construction and Analysis of Systems, 407–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-49674-9_24.
Повний текст джерелаТези доповідей конференцій з теми "080201 Analysis of Algorithms and Complexity"
Neumann, Frank, and Andrew M. Sutton. "Parameterized Complexity Analysis of Evolutionary Algorithms." In GECCO '15: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2739482.2756562.
Повний текст джерелаNeumann, Frank, and Andrew M. Sutton. "Parameterized complexity analysis of evolutionary algorithms." In GECCO '14: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2598394.2605351.
Повний текст джерелаKulcke, Matthias, and Wolfgang Lorenz. "Utilizing Gradient Analysis within Interactive Genetic Algorithms." In eCAADe 2016: Complexity & Simplicity. eCAADe, 2016. http://dx.doi.org/10.52842/conf.ecaade.2016.2.359.
Повний текст джерелаMaciel, Tarcisio F., and Anja Klein. "A performance-complexity analysis of four suboptimal SDMA algorithms." In 2008 International ITG Workshop on Smart Antennas. IEEE, 2008. http://dx.doi.org/10.1109/wsa.2008.4475563.
Повний текст джерелаHoefler, Torsten, and Grzegorz Kwasniewski. "Automatic complexity analysis of explicitly parallel programs." In SPAA '14: 26th ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2612669.2612685.
Повний текст джерелаRahaman, Sadiqur, Shahnewaz Shahabuddin, Md Belayat Hossain, and Shahriar Shahabuddin. "Complexity analysis of matrix decomposition algorithms for linear MIMO detection." In 2016 International Conference on Informatics, Electronics and Vision (ICIEV). IEEE, 2016. http://dx.doi.org/10.1109/iciev.2016.7760136.
Повний текст джерелаProzorov, Dmitriy, and Alexandra Tatarinova. "Analysis of the Computational Complexity of Algorithms for Phonemic Transcription." In 2018 IEEE East-West Design & Test Symposium (EWDTS). IEEE, 2018. http://dx.doi.org/10.1109/ewdts.2018.8524701.
Повний текст джерелаSmith, Peter, Tim King, Lee Garth, and Mischa Dohler. "An Analysis of Low Complexity Algorithms for MIMO Antenna Selection." In 2006 IEEE International Conference on Communications. IEEE, 2006. http://dx.doi.org/10.1109/icc.2006.254941.
Повний текст джерелаFerreira, Tais Borges, Marcia Aparecida Fernandes, and Rivalino Matias Jr. "A Comprehensive Complexity Analysis of User-Level Memory Allocator Algorithms." In 2012 Brazilian Symposium on Computing System Engineering (SBESC). IEEE, 2012. http://dx.doi.org/10.1109/sbesc.2012.27.
Повний текст джерелаSinchana, G. S., Sneha Padaki, Veena Ravi, Velury Suguna Varshini, and C. G. Raghavendra. "Software Implementation of FFT Algorithms and Analysis of their Computational Complexity." In 2018 Third International Conference on Electrical, Electronics, Communication, Computer Technologies and Optimization Techniques (ICEECCOT). IEEE, 2018. http://dx.doi.org/10.1109/iceeccot43722.2018.9001665.
Повний текст джерелаЗвіти організацій з теми "080201 Analysis of Algorithms and Complexity"
Luo, Zhi-Quan. Complexity Analysis and Algorithms for Optimal Resource Allocation in Wireless Networks. Fort Belvoir, VA: Defense Technical Information Center, September 2012. http://dx.doi.org/10.21236/ada579191.
Повний текст джерелаAriyawansa, K. A. Low-Complexity Interior Point Algorithms for Stochastic Programming: Derivation Analysis and Performance Evaluation. Fort Belvoir, VA: Defense Technical Information Center, January 2000. http://dx.doi.org/10.21236/ada418278.
Повний текст джерелаSoloviev, Vladimir, Victoria Solovieva, Anna Tuliakova, Alexey Hostryk, and Lukáš Pichl. Complex networks theory and precursors of financial crashes. [б. в.], October 2020. http://dx.doi.org/10.31812/123456789/4119.
Повний текст джерелаPerdigão, Rui A. P. Information physics and quantum space technologies for natural hazard sensing, modelling and prediction. Meteoceanics, September 2021. http://dx.doi.org/10.46337/210930.
Повний текст джерелаRigotti, Christophe, and Mohand-Saïd Hacid. Representing and Reasoning on Conceptual Queries Over Image Databases. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.89.
Повний текст джерелаRigotti, Christophe, and Mohand-Saïd Hacid. Representing and Reasoning on Conceptual Queries Over Image Databases. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.89.
Повний текст джерела