Статті в журналах з теми "080201 Analysis of Algorithms and Complexity"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "080201 Analysis of Algorithms and Complexity".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
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.
Повний текст джерелаCohen, Edith, and Nimrod Megiddo. "Algorithms and complexity analysis for some flow problems." Algorithmica 11, no. 3 (March 1994): 320–40. http://dx.doi.org/10.1007/bf01240739.
Повний текст джерелаIbarra, Oscar H., Pedro C. Diniz, and Martin C. Rinard. "On the Complexity of Commutativity Analysis." International Journal of Foundations of Computer Science 08, no. 01 (March 1997): 81–94. http://dx.doi.org/10.1142/s0129054197000069.
Повний текст джерелаGohberg, I., T. Kailath, and I. Koltracht. "Linear complexity algorithms for semiseparable matrices." Integral Equations and Operator Theory 8, no. 6 (November 1985): 780–804. http://dx.doi.org/10.1007/bf01213791.
Повний текст джерелаChandrasekaran, M., P. Sriramya, B. Parvathavarthini, and M. Saravanamanikandan. "Computational Complexity Analysis of Selective Breeding Algorithm." Applied Mechanics and Materials 591 (July 2014): 172–75. http://dx.doi.org/10.4028/www.scientific.net/amm.591.172.
Повний текст джерелаB, Sarada, Vinayaka Murthy. M, and Udaya Rani. V. "Analysis of large volume data processing using clustering algorithms." International Journal of Engineering & Technology 7, no. 4.5 (September 22, 2018): 685. http://dx.doi.org/10.14419/ijet.v7i4.5.25058.
Повний текст джерелаShrawankar, Urmila, and Krutika Jayant Sapkal. "Complexity Analysis of Vedic Mathematics Algorithms for Multicore Environment." International Journal of Rough Sets and Data Analysis 4, no. 4 (October 2017): 31–47. http://dx.doi.org/10.4018/ijrsda.2017100103.
Повний текст джерелаHe, Jun, and Xin Yao. "Drift analysis and average time complexity of evolutionary algorithms." Artificial Intelligence 127, no. 1 (March 2001): 57–85. http://dx.doi.org/10.1016/s0004-3702(01)00058-3.
Повний текст джерелаPeng, Chao, Jie Zhou, Binhai Zhu, and Hong Zhu. "Complexity analysis and algorithms for the Program Download Problem." Journal of Combinatorial Optimization 29, no. 1 (February 4, 2014): 216–27. http://dx.doi.org/10.1007/s10878-013-9702-0.
Повний текст джерелаPhan, Anh-Huy, Petr Tichavský, and Andrzej Cichocki. "Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC." SIAM Journal on Matrix Analysis and Applications 34, no. 1 (January 2013): 126–47. http://dx.doi.org/10.1137/100808034.
Повний текст джерелаGiménez, Nardo, Joos Heintz, Guillermo Matera, and Pablo Solernó. "Lower complexity bounds for interpolation algorithms." Journal of Complexity 27, no. 2 (April 2011): 151–87. http://dx.doi.org/10.1016/j.jco.2010.10.003.
Повний текст джерелаOkada, Hugo Kenji Rodrigues, Andre Ricardo Nascimento das Neves, and Ricardo Shitsuka. "Analysis of Decision Tree Induction Algorithms." Research, Society and Development 8, no. 11 (August 24, 2019): e298111473. http://dx.doi.org/10.33448/rsd-v8i11.1473.
Повний текст джерелаSemenets, Valerii, O. S. Marukhnenko, I. D. Gorbenko, and G. Z. Khalimov. "Comparative analysis of one-time hash-based signatures." Radiotekhnika, no. 203 (December 23, 2020): 5–18. http://dx.doi.org/10.30837/rt.2020.4.203.01.
Повний текст джерелаAllan de Oliveira Veras, Adonney. "Complexity analysis of algorithms: A case study on bioinformatics tools." World Journal of Biology and Biotechnology 6, no. 3 (October 3, 2021): 11. http://dx.doi.org/10.33865/wjb.006.03.0445.
Повний текст джерелаPasqualetti, Fabio, Antonio Franchi, and Francesco Bullo. "On Cooperative Patrolling: Optimal Trajectories, Complexity Analysis, and Approximation Algorithms." IEEE Transactions on Robotics 28, no. 3 (June 2012): 592–606. http://dx.doi.org/10.1109/tro.2011.2179580.
Повний текст джерелаLitvinov, G. L. "Idempotent and tropical mathematics; complexity of algorithms and interval analysis." Computers & Mathematics with Applications 65, no. 10 (May 2013): 1483–96. http://dx.doi.org/10.1016/j.camwa.2012.09.008.
Повний текст джерелаTadayon, Bita, and J. Cole Smith. "Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems." Journal of Scheduling 18, no. 6 (February 6, 2015): 575–92. http://dx.doi.org/10.1007/s10951-015-0418-0.
Повний текст джерелаVinokur, A. B., and G. P. Kozhevnikova. "Complexity analysis of algorithms by recognition of their classification properties." Cybernetics and Systems Analysis 27, no. 6 (November 1991): 840–52. http://dx.doi.org/10.1007/bf01246515.
Повний текст джерелаKaraman, Ayşe, and Hossam Hassanein. "Core-selection algorithms in multicast routing - comparative and complexity analysis." Computer Communications 29, no. 8 (May 2006): 998–1014. http://dx.doi.org/10.1016/j.comcom.2005.06.003.
Повний текст джерелаGaviano, M., and D. Lera. "A Complexity Analysis of Local Search Algorithms in Global Optimization." Optimization Methods and Software 17, no. 1 (January 2002): 113–27. http://dx.doi.org/10.1080/10556780290027783.
Повний текст джерелаRapine, Christophe, Guillaume Goisque, and Ayse Akbalik. "Energy-aware lot sizing problem: Complexity analysis and exact algorithms." International Journal of Production Economics 203 (September 2018): 254–63. http://dx.doi.org/10.1016/j.ijpe.2018.06.020.
Повний текст джерелаWinograd, Joseph M., and S. Hamid Nawab. "Probabilistic complexity analysis for a class of approximate DFT algorithms." Journal of VLSI signal processing systems for signal, image and video technology 14, no. 2 (November 1996): 193–205. http://dx.doi.org/10.1007/bf00925499.
Повний текст джерелаThameri, Messaoud, Karim Abed-Meraim, and Adel Belouchrani. "Low complexity adaptive algorithms for Principal and Minor Component Analysis." Digital Signal Processing 23, no. 1 (January 2013): 19–29. http://dx.doi.org/10.1016/j.dsp.2012.09.007.
Повний текст джерелаKohli, Rajeev, and Ramesh Krishnamurti. "Optimal product design using conjoint analysis: Computational complexity and algorithms." European Journal of Operational Research 40, no. 2 (May 1989): 186–95. http://dx.doi.org/10.1016/0377-2217(89)90329-9.
Повний текст джерелаJiang, Bo, Tianyi Lin, Shiqian Ma, and Shuzhong Zhang. "Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis." Computational Optimization and Applications 72, no. 1 (September 25, 2018): 115–57. http://dx.doi.org/10.1007/s10589-018-0034-y.
Повний текст джерелаMa, Hang. "Extended Abstract: A Competitive Analysis of Online Multi-Agent Path Finding." Proceedings of the International Symposium on Combinatorial Search 12, no. 1 (July 21, 2021): 182–84. http://dx.doi.org/10.1609/socs.v12i1.18577.
Повний текст джерелаOlver, Sheehan, Richard Mikaël Slevinsky, and Alex Townsend. "Fast algorithms using orthogonal polynomials." Acta Numerica 29 (May 2020): 573–699. http://dx.doi.org/10.1017/s0962492920000045.
Повний текст джерелаAhmed, Asad, Osman Hasan, Falah Awwad, Nabil Bastaki, and Syed Rafay Hasan. "Formal Asymptotic Analysis of Online Scheduling Algorithms for Plug-In Electric Vehicles’ Charging." Energies 12, no. 1 (December 21, 2018): 19. http://dx.doi.org/10.3390/en12010019.
Повний текст джерелаGilman, Jane. "Algorithms, complexity and discreteness criteria in PSL(2, C)." Journal d'Analyse Mathématique 73, no. 1 (December 1997): 91–114. http://dx.doi.org/10.1007/bf02788139.
Повний текст джерелаKreyndelin, Vitaly B., and Elena D. Grigorieva. "ANALYSIS OF FAST ALGORITHM OF MATRIX-VECTOR MULTIPLICATION FOR THE BANK OF DIGITAL FILTERS." T-Comm 15, no. 1 (2021): 4–10. http://dx.doi.org/10.36724/2072-8735-2021-15-1-4-10.
Повний текст джерелаKim, Bong-seok, Sangdong Kim, Youngseok Jin, and Jonghun Lee. "Low-Complexity Joint Range and Doppler FMCW Radar Algorithm Based on Number of Targets." Sensors 20, no. 1 (December 20, 2019): 51. http://dx.doi.org/10.3390/s20010051.
Повний текст джерелаRomaguera, S., P. Tirado, and O. Valero. "New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces." International Journal of Computer Mathematics 89, no. 13-14 (September 2012): 1728–41. http://dx.doi.org/10.1080/00207160.2012.659246.
Повний текст джерелаSelvi, V. "Clustering Analysis of Greedy Heuristic Method in Zero_One Knapsack Problem." International Journal of Emerging Research in Management and Technology 6, no. 7 (June 29, 2018): 39. http://dx.doi.org/10.23956/ijermt.v6i7.181.
Повний текст джерелаChernov, N., C. Lesort, and N. Simányi. "On the complexity of curve fitting algorithms." Journal of Complexity 20, no. 4 (August 2004): 484–92. http://dx.doi.org/10.1016/j.jco.2004.01.004.
Повний текст джерелаRyabko, Boris Ya. "The Complexity and Effectiveness of Prediction Algorithms." Journal of Complexity 10, no. 3 (September 1994): 281–95. http://dx.doi.org/10.1006/jcom.1994.1015.
Повний текст джерелаCLÉMENT, J., T. H. NGUYEN THI, and B. VALLÉE. "Towards a Realistic Analysis of Some Popular Sorting Algorithms." Combinatorics, Probability and Computing 24, no. 1 (December 11, 2014): 104–44. http://dx.doi.org/10.1017/s0963548314000649.
Повний текст джерелаLv, Ming Xia, Yan Kun Lai, and Dong Tang. "Performance Analysis of Low Complexity Multiuser Scheduling Algorithms in MIMO System." Applied Mechanics and Materials 392 (September 2013): 867–71. http://dx.doi.org/10.4028/www.scientific.net/amm.392.867.
Повний текст джерелаCorus, Dogan, Per Kristian Lehre, Frank Neumann, and Mojgan Pourhassan. "A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms." Evolutionary Computation 24, no. 1 (March 2016): 183–203. http://dx.doi.org/10.1162/evco_a_00147.
Повний текст джерелаLiu, Ya-Feng, Yu-Hong Dai, and Zhi-Quan Luo. "Coordinated Beamforming for MISO Interference Channel: Complexity Analysis and Efficient Algorithms." IEEE Transactions on Signal Processing 59, no. 3 (March 2011): 1142–57. http://dx.doi.org/10.1109/tsp.2010.2092772.
Повний текст джерелаHe, Jun, and Xin Yao. "Erratum to: Drift analysis and average time complexity of evolutionary algorithms." Artificial Intelligence 140, no. 1-2 (September 2002): 245–48. http://dx.doi.org/10.1016/s0004-3702(02)00260-6.
Повний текст джерелаZhang, Junyu, Shiqian Ma, and Shuzhong Zhang. "Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis." Mathematical Programming 184, no. 1-2 (August 10, 2019): 445–90. http://dx.doi.org/10.1007/s10107-019-01418-8.
Повний текст джерела