Výsledky vyhľadávania - "comparison of algorithms"

Comparative Visualization of Algorithms and Data Structures

Autori: Vateha, Filip Šimoňák, Slavomír

Zdroj: Computing and Informatics; Vol. 44 No. 2 (2025): Computing and Informatics; 336–365

Predmety: data structures, 97U50, JSAV, 68Q65, 68P10, comparison of algorithms, web application, 68P05, Algorithms, visualization

Popis súboru: application/pdf

Prístupová URL adresa: https://www.cai.sk/ojs/index.php/cai/article/view/2025_2_336

EISPY2D: An Open-Source Python Library for the Development and Comparison of Algorithms in Two-Dimensional Electromagnetic Inverse Scattering Problems

Autori: André Costa Batista Ricardo Adriano Lucas S. Batista

Zdroj: IEEE Access, Vol 13, Pp 92134-92154 (2025)

Predmety: Signal Processing (eess.SP), FOS: Computer and information sciences, electromagnetic inverse scattering problem, FOS: Physical sciences, 02 engineering and technology, Comparison of algorithms, Computational Physics (physics.comp-ph), TK1-9971, Computational Engineering, Finance, and Science (cs.CE), open-source library, 0202 electrical engineering, electronic engineering, information engineering, FOS: Electrical engineering, electronic engineering, information engineering, microwave imaging, Electrical engineering. Electronics. Nuclear engineering, Electrical Engineering and Systems Science - Signal Processing, Computer Science - Computational Engineering, Finance, and Science, optimization, Physics - Computational Physics

Prístupová URL adresa: http://arxiv.org/abs/2111.02185
https://doaj.org/article/a07ca701d0044d2f8da2977a079fd318

Searching long patterns with BNDM

Autori: Tarhio Jorma Department of Computer Science Aalto-yliopisto a ďalší

Prispievatelia: Tarhio Jorma Department of Computer Science Aalto-yliopisto a ďalší

Zdroj: Software: Practice and Experience. 54:2160-2169

Predmety: experimental comparison of algorithms, exact string matching, 0202 electrical engineering, electronic engineering, information engineering, fingerprint, q-gram, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: https://aaltodoc.aalto.fi/handle/123456789/131333

Towards accurate estimation of fast varying frequency in future electricity networks: The transition from model-free methods to model-based approach

Autori: Stotsky, Alexander, 1960

Zdroj: Proceedings of the Institution of Mechanical Engineers. Part I: Journal of Systems and Control Engineering. 230(10):1164-1175

Predmety: statistical quantification methods of comparison of algorithms, multiple model, Accurate frequency tracking in future electricity networks, harmonic regressor, inversion of ill-conditioned matrices, stepwise splitting, high-order algorithms

Popis súboru: electronic

Prístupová URL adresa: https://research.chalmers.se/publication/246864
http://publications.lib.chalmers.se/records/fulltext/246864/local_246864.pdf

Fragile complexity of adaptive algorithms

Autori: Prosenjit Bose John Iacono Rolf Fagerberg a ďalší

Prispievatelia: Prosenjit Bose John Iacono Rolf Fagerberg a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783030752415
Lecture notes in computer science, 12701 LNCS
Lecture notes in computer science, 12701
arXiv.org
Jacob, R, Fagerberg, R, Bose, P, Cano, P, Iacono, J & Langerman, S 2021, Fragile Complexity of Adaptive Algorithms. in International Conference on Algorithms and Complexity. vol. LNCS 12701, Springer, LNCS, vol. 12701, pp. 144-157. < https://www.researchgate.net/publication/348959027_Fragile_Complexity_of_Adaptive_Algorithms >
Jacob, R, Fagerberg, R, Bose, P, Cano, P, Iacono, J & Langerman, S 2022, 'Fragile complexity of adaptive algorithms', Theoretical Computer Science, vol. 915, pp. 92-102. https://doi.org/10.1016/j.tcs.2022.03.034
Bose, P, Cano, P, Fagerberg, R, Iacono, J, Jacob, R & Langerman, S 2021, Fragile Complexity of Adaptive Algorithms . in T Calamoneri & F Corò (eds), Algorithms and Complexity-12th International Conference, CIAC 2021, Proceedings . Springer, Lecture Notes in Computer Science, vol. 12701, pp. 144-157, 12th International Conference on Algorithms and Complexity, CIAC 2021, Virtual, Online, 10/05/2021 . https://doi.org/10.1007/978-3-030-75242-2_10
Bose, P, Cano, P, Fagerberg, R, Iacono, J, Jacob, R & Langerman, S 2022, ' Fragile complexity of adaptive algorithms ', Theoretical Computer Science, vol. 919, pp. 92-102 . https://doi.org/10.1016/j.tcs.2022.03.034

Predmety: FOS: Computer and information sciences, Théorie de l'information, Informatique générale, 0102 computer and information sciences, Comparison based algorithms, Fragile complexity, 01 natural sciences, Théorie des algorithmes, 68W05, 68W20, Informatique mathématique, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), F.2.2, 0101 mathematics, Algorithms

Popis súboru: 1 full-text file(s): application/pdf; application/pdf

Prístupová URL adresa: https://arxiv.org/pdf/2102.00338
http://arxiv.org/abs/2102.00338
https://rd.springer.com/chapter/10.1007/978-3-030-75242-2_10
https://portal.findresearcher.sdu.dk/da/publications/fragile-complexity-of-adaptive-algorithms
https://dblp.uni-trier.de/db/journals/corr/corr2102.html#abs-2102-00338
https://link.springer.com/chapter/10.1007/978-3-030-75242-2_10
https://doi.org/10.1007/978-3-030-75242-2_10
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/324965
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/326122
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/326125
https://pure.itu.dk/portal/da/publications/b096b2bc-e2f6-4fc3-b7f6-460c13d33ae1
https://pure.itu.dk/ws/files/91125160/2102.00338_1_.pdf
https://portal.findresearcher.sdu.dk/da/publications/1de60fdb-542e-470d-bd75-4959dd3bb157
https://portal.findresearcher.sdu.dk/da/publications/1de60fdb-542e-470d-bd75-4959dd3bb157
https://doi.org/10.1007/978-3-030-75242-2_10
https://portal.findresearcher.sdu.dk/da/publications/2a9c2c81-5b44-46b8-915a-304d3ba7c124

SEQUENCING OPTICAL IMAGES APPROXIMATED BY HOMOGENEOUS, ONE-DIMENSIONAL POINT RENEWAL PROCESS

Autori: Alexander I. Kochegurov Dmitriy V. Dubinin Viktor Geringer

Zdroj: Известия Томского политехнического университета: Промышленная кибернетика, Vol 1, Iss 1, Pp 1-6 (2023)

Predmety: stochastic modelling, optical flow, comparison of algorithms, image processing, Cybernetics, Q300-390, Computer software, QA76.75-76.765, Computer engineering. Computer hardware, TK7885-7895

Popis súboru: electronic resource

Relation: https://indcyb.ru/journal/article/view/1/1; https://doaj.org/toc/2949-5407

Prístupová URL adresa: https://doaj.org/article/5c3f9b140d0b4348932527bac57eb922

Improved online algorithms for jumbled matching

Autori: Ghuman, Sukhpal Singh Tarhio, Jorma Chhabra a ďalší

Zdroj: Discrete Applied Mathematics. 274:54-66

Predmety: ta113, Abelian matching, Approximate string matching, Jumbled matching, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Comparison of algorithms, 01 natural sciences, Algorithm engineering, SIMD computation

Prístupová URL adresa: https://aaltodoc.aalto.fi:443/bitstream/123456789/29631/1/isbn9789526077581.pdf
https://www.sciencedirect.com/science/article/abs/pii/S0166218X18302890
https://aaltodoc.aalto.fi:443/handle/123456789/29631
https://aaltodoc.aalto.fi:443/bitstream/123456789/29631/1/isbn9789526077581.pdf
https://dblp.uni-trier.de/db/journals/dam/dam274.html#GhumanTC20

О различных подходах к проверке решения графических задач: On various approaches to automated grading of graphic assignments

Zdroj: Труды НИИСИ РАН. 9:148-155

Predmety: education, тесты, grading automation, grading, сравнение алгоритмов, neural networks, проверка, образование, компьютерная графика, computer graphics, автоматизация проверки, tests, нейронные сети, автоматизация, comparison of algorithms, automation

On Assessment of Efficiency of Weather Routing Algorithms

Autori: Maksim Korovkin Sergei Pogozhev Margarita Sotnikova

Zdroj: Современные информационные технологии и IT-образование, Vol 17, Iss 2, Pp 275-284 (2021)

Predmety: weather routing, performance evaluation, comparison of algorithms, Electronic computers. Computer science, QA75.5-76.95

Popis súboru: electronic resource

Relation: http://sitito.cs.msu.ru/index.php/SITITO/article/view/757; https://doaj.org/toc/2411-1473

Prístupová URL adresa: https://doaj.org/article/a97a697983154006b498342ea865cb1b

Universal Sorting: Finding a DAG using Priced Comparisons

Autori: Jacob, Riko Goswami, Mayank

Zdroj: Jacob, R & Goswami, M 2022, Universal Sorting: Finding a DAG using Priced Comparisons. https://doi.org/10.48550/arXiv.2211.04601

Predmety: Data Structures and Algorithms, Comparison based algorithms, Sorting

Dostupnosť: https://pure.itu.dk/portal/da/publications/28e3d92b-0fb2-4001-a253-653ea80fc6a7
https://doi.org/10.48550/arXiv.2211.04601

Comparison of Evolutionary Algorithms for Estimation of Parameters of the Equivalent Circuit of an AC Motor

Autori: Heredia López, Alfonso Jesús Ramos, Guillermo A

Zdroj: Communications in Computer and Information Science ISBN: 9783030030223

Predmety: Motores eléctricos de inducción, 0209 industrial biotechnology, Algoritmos, Electric motors, Estimation of parameters, 02 engineering and technology, Comparison of algorithms, Evolutionary algorithms, Algorithms, AC motor, Induction, Electric motors, Induction

Popis súboru: application/pdf

Prístupová URL adresa: https://red.uao.edu.co/bitstream/10614/11410/4/Comparison%20of%20evolutionary%20algorithms%20for%20estimation%20of%20parameters%20of%20the%20equivalent%20circuit%20of%20an%20AC%20motor.pdf
https://red.uao.edu.co/handle/10614/11410
https://link.springer.com/chapter/10.1007/978-3-030-03023-0_11
https://link.springer.com/content/pdf/10.1007%2F978-3-030-03023-0_11.pdf
https://ieeexplore.ieee.org/document/8484857

Pitfalls of Algorithm Comparison

Autori: Peltola, Hannu Tarhio, Jorma Watson a ďalší

Predmety: ta113, experimental comparison of algorithms, exact string matching

Prístupová URL adresa: http://juuli.fi/Record/0384099621

Fragile complexity of adaptive algorithms

Autori: Bose, Prosenjit Cano, Pilar Fagerberg, Rolf a ďalší

Zdroj: Theoretical computer science, 919

Predmety: Théorie des algorithmes, Informatique générale, Théorie de l'information, Algorithms, Comparison based algorithms, Fragile complexity

Popis súboru: 1 full-text file(s): application/pdf

Relation: uri/info:doi/10.1016/j.tcs.2022.03.034; uri/info:pii/S0304397522001840; uri/info:scp/85127946803; https://dipot.ulb.ac.be/dspace/bitstream/2013/356021/1/elsevier_339665.pdf

Dostupnosť: http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/356021
https://dipot.ulb.ac.be/dspace/bitstream/2013/356021/1/elsevier_339665.pdf

Research on Constructing Online Learning Performance Prediction Model Combining Feature Selection and Neural Network

Autori: Mi, Huichao Gao, Zhanghao Zhang, Qiaorong a ďalší

Zdroj: International Journal of Emerging Technologies in Learning (iJET); Vol. 17 No. 07 (2022); pp. 94-111 ; 1863-0383

Predmety: learning performance prediction, machine learning, logistic regression, decision tree algorithm, naive bayes, support vector machine, deep neural networks, learn-ing behavior, comparison of algorithms

Popis súboru: application/pdf

Relation: https://online-journals.org/index.php/i-jet/article/view/25587/11113

Dostupnosť: https://online-journals.org/index.php/i-jet/article/view/25587

Fragile Complexity of Adaptive Algorithms

Autori: Bose, Prosenjit Cano, Pilar Fagerberg, Rolf a ďalší

Zdroj: Lecture notes in computer science, 12701 LNCS

Predmety: Informatique mathématique, Informatique générale, Algorithms, Comparison based algorithms, Fragile complexity

Popis súboru: 1 full-text file(s): application/pdf

Relation: uri/info:scp/85106173925; https://dipot.ulb.ac.be/dspace/bitstream/2013/324965/3/Fragilityproblems.pdf

Dostupnosť: http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/324965
https://dipot.ulb.ac.be/dspace/bitstream/2013/324965/3/Fragilityproblems.pdf

Fragile Complexity of Adaptive Algorithms

Autori: Jacob, Riko Fagerberg, Rolf Bose, Prosenjit a ďalší

Zdroj: Jacob, R, Fagerberg, R, Bose, P, Cano, P, Iacono, J & Langerman, S 2021, Fragile Complexity of Adaptive Algorithms. in International Conference on Algorithms and Complexity. vol. LNCS 12701, Springer, LNCS, vol. 12701, pp. 144-157. < https://www.researchgate.net/publication/348959027_Fragile_Complexity_of_Adaptive_Algorithms >

Predmety: Algorithms, Fragile complexity, Comparison based algorithms

Popis súboru: application/pdf

Dostupnosť: https://pure.itu.dk/portal/da/publications/b096b2bc-e2f6-4fc3-b7f6-460c13d33ae1
https://pure.itu.dk/ws/files/86579703/2102.00338.pdf
https://www.researchgate.net/publication/348959027_Fragile_Complexity_of_Adaptive_Algorithms

Fragile Complexity of Comparison-Based Algorithms

Autori: Rolf Fagerberg Nodari Sitchinava Manuel Penschuck a ďalší

Prispievatelia: Rolf Fagerberg Nodari Sitchinava Manuel Penschuck a ďalší

Zdroj: Afshani, P, Fagerberg, R, Hammer, D M G, Jacob, R, Kostitsyna, I, Meyer, U, Penschuck, M & Sitchinava, N 2019, Fragile Complexity of Comparison-Based Algorithms. in 27th Annual European Symposium on Algorithms (ESA 2019)., 2, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik GmbH, Leibniz International Proceedings in Informatics (LIPIcs), pp. 2:1–2:19. https://doi.org/10.4230/LIPIcs.ESA.2019.2
Afshani, P, Fagerberg, R, Hammer, D, Jacob, R, Kostitsyna, I, Meyer, U, Penschuck, M & Sitchinava, N 2019, Fragile complexity of comparison-based algorithms . in M A Bender, O Svensson & G Herman (eds), Proceedings of 27th Annual European Symposium on Algorithms, ESA 2019 ., 2, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 144, pp. 2:1-2:19, 27th Annual European Symposium on Algorithms, ESA 2019, Munich/Garching, Germany, 09/09/2019 . https://doi.org/10.4230/LIPIcs.ESA.2019.2
Afshani, P, Fagerberg, R, Hammer, D, Jacob, R, Kostitsyna, I, Meyer, U, Penschuck, M & Sitchinava, N 2019, Fragile complexity of comparison-based algorithms. in M A Bender, O Svensson & G Herman (eds), 27th Annual European Symposium on Algorithms, ESA 2019., 2, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 144, 27th Annual European Symposium on Algorithms, ESA 2019, Munich/Garching, Germany, 09/09/2019. https://doi.org/10.4230/LIPIcs.ESA.2019.2

Predmety: FOS: Computer and information sciences, Computational Complexity, Deterministic and Randomized Bounds, Comparison-Based Algorithms, Lower bounds, comparison based algorithms, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), Comparison based algorithms, 01 natural sciences, lower bounds, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Fragile Complexity, ddc:004, Comparator Networks, Algorithms

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/1901.02857
https://pure.tue.nl/ws/files/144338516/LIPIcs_ESA_2019_2.pdf
http://dblp.uni-trier.de/db/journals/corr/corr1901.html#abs-1901-02857
https://drops.dagstuhl.de/opus/volltexte/2019/11123/
https://dblp.uni-trier.de/db/journals/corr/corr1901.html#abs-1901-02857
https://research.tue.nl/nl/publications/fragile-complexity-of-comparison-based-algorithms
https://drops.dagstuhl.de/opus/volltexte/2019/11123/pdf/LIPIcs-ESA-2019-2.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.2
https://pure.itu.dk/ws/files/84740938/LIPIcs_ESA_2019_2.pdf
https://findresearcher.sdu.dk:8443/ws/files/157164666/LIPIcs_ESA_2019_2.pdf

Noisy Optimization: Fast Convergence Rates with Comparison-Based Algorithms

Autori: Cauwet, Marie-Liesse Teytaud, Olivier T. Friedrich and F. Neumann

Prispievatelia: Cauwet, Marie-Liesse Teytaud, Olivier T. Friedrich and F. Neumann

Zdroj: Proceedings of the Genetic and Evolutionary Computation Conference 2016. :1101-1106

Predmety: Noisy continuous optimization, Optimization and Control (math.OC), FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Comparison-based Algorithms, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], 0102 computer and information sciences, 02 engineering and technology, Mathematics - Optimization and Control, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/1604.08459
https://hal.science/hal-01306636v2
https://hal.science/hal-01306636v2/document
https://dblp.uni-trier.de/db/conf/gecco/gecco2016.html#CauwetT16
https://doi.org/10.1145/2908812.2908881
https://dl.acm.org/citation.cfm?id=2908812.2908881
https://dl.acm.org/doi/pdf/10.1145/2908812.2908881
https://tel.archives-ouvertes.fr/INRIA/hal-01306636v2
https://hal.archives-ouvertes.fr/hal-01306636v2

Progress-Space Tradeoffs in Single-Writer Memory Implementations

Autori: Imbs, Damien Kuznetsov, Petr Rieutord, Thibault a ďalší

Prispievatelia: Imbs, Damien Kuznetsov, Petr Rieutord, Thibault a ďalší

Predmety: Single-writer memory implementation, comparison-based algorithms, space complexity, progress conditions

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 95, 21st International Conference on Principles of Distributed Systems (OPODIS 2017); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2017.9

Dostupnosť: https://doi.org/10.4230/LIPIcs.OPODIS.2017.9
https://nbn-resolving.org/urn:nbn:de:0030-drops-86290
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2017.9

Fragile complexity of comparison-based algorithms

Autori: Afshani, Peyman Fagerberg, Rolf Hammer, David a ďalší

Prispievatelia: Afshani, Peyman Fagerberg, Rolf Hammer, David a ďalší

Zdroj: Afshani, P, Fagerberg, R, Hammer, D, Jacob, R, Kostitsyna, I, Meyer, U, Penschuck, M & Sitchinava, N 2019, Fragile complexity of comparison-based algorithms. in M A Bender, O Svensson & G Herman (eds), Proc. 27th Annual European Symposium on Algorithms (ESA)., 2, Leibniz International Proceedings in Informatics, LIPIcs, vol. 144, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 27th Annual European Symposium on Algorithms, ESA 2019, Munich/Garching, Germany, 9/09/19. https://doi.org/10.4230/LIPIcs.ESA.2019.2

Predmety: Algorithms, Comparison based algorithms, Lower bounds

Popis súboru: application/pdf

Relation: info:eu-repo/semantics/altIdentifier/wos/000570729400002; info:eu-repo/semantics/altIdentifier/isbn/9783959771245; urn:ISBN:9783959771245

Dostupnosť: https://research.tue.nl/en/publications/9bffcc00-c79e-47a7-bc29-d6113838f494
https://doi.org/10.4230/LIPIcs.ESA.2019.2
https://pure.tue.nl/ws/files/144338516/LIPIcs_ESA_2019_2.pdf
https://www.scopus.com/pages/publications/85074867612