Готові списки джерел за темами / Software algorithm

Добірка наукової літератури з теми "Software algorithm"

Автор: Grafiati
Опубліковано: 30 травня 2022
Оновлено: 31 травня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Software algorithm".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Software algorithm"

1

Sharma, Divya, and Shikha Lohchab. "Search based Software Modularization Using Evolution Algorithm." NeuroQuantology 20, no. 5 (May 18, 2022): 822–31. http://dx.doi.org/10.14704/nq.2022.20.5.nq22240.

Повний текст джерела
Анотація:
To comprehend a Software system, Software modularization strategies are used. The goal of modularization is to break down a software system into meaningful and intelligible sub-systems from its source-code (modules). Because software classification modularization is an NP-hard task, evolutionary methods produce better modularization quality rather than avaricious algorithms. All available transformative techniques for software modularization only take into account structural aspects reliant on programming language syntax. Because most computer languages lack a mechanism for extracting structural characteristics, they cannot be modularized. A novel heuristic is proposed in this work. with several objectives that accomplishes both in order to lead optimization algorithms towards a proper decomposition of software systems automatically, structural (e.g.; calling dependence and in-heritance dependency) and non- structural (e.g.; semantics in code comments and identifier names) aspects are used. It is analyzed using 3 optimization plans, viz; global-based-search, combining global and local search, and Estimation of Distribution (EoD) to upgrade it. According to outcomes on Mozilla Firefox, suggested optimization algorithm based on EoD and the newly developed MOF function exceed those so it use structural-based objective functions in finding more understandable modules, as well as guiding the optimization procedure. In the lack of a unique concept, structure, the original design can be identified by using the source code of the disturbed software. Effective software maintenance depends on the concept of software system. One of most powerful techniques in software clustering is the ability to divide enormous Software systems into workable subsystems with modules of identical characteristics, thereby reducing the complexity of the system. A metaheuristic optimization imperialist competitive system has emerged algorithm, genetic algorithm, and their combination is examined for software clustering in this paper. When it comes to value, of clustering, the number of epochs required for convergence, and the standard unconventionality found at the end of repeated application of these algorithms, it appears that recursive application is the most effective for achieving the best performance.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

RAJALAKSHMI.M, RAJALAKSHMI M. "Software System Re-Modularization using Interactive Genetic Algorithm." Paripex - Indian Journal Of Research 3, no. 4 (January 15, 2012): 105–7. http://dx.doi.org/10.15373/22501991/apr2014/32.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Hutagalung, Cerlinto. "Banker Algorithm Simulation Software." Instal : Jurnal Komputer 12, no. 02 (October 26, 2021): 61–68. http://dx.doi.org/10.54209/jurnalkomputer.v12i02.22.

Повний текст джерела
Анотація:
Banker's algorithm is an algorithm that models a bank in a small town dealing with a set of customers. This banker algorithm is used to deal with queuing problems in banking. In this case, one of them is how to simulate queues in banking. In this study, the design and manufacture of simulation software is used to help simulate whether a system is in a safe state or an unsafe state, in a safe condition the process is continued but if the process is unsafe the process is delayed until the system is in a safe state. The result of this research is a banker algorithm simulation software that models a banker who is dealing with a group of customers in a bank.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

ZOMORODIAN, AFRA, and HERBERT EDELSBRUNNER. "FAST SOFTWARE FOR BOX INTERSECTIONS." International Journal of Computational Geometry & Applications 12, no. 01n02 (February 2002): 143–72. http://dx.doi.org/10.1142/s0218195902000785.

Повний текст джерела
Анотація:
We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler algorithms for low numbers of boxes. We use our implementations as engines to solve problems about geometric primitives. We look at two such problems in the category of quality analysis of surface triangulations.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

LAVRENCHUK, Svitlana, Nina ZDOLBITSKA, and Nadiia KHAMULA. "SOFTWARE COMPLEX FOR GRAPH ALGORITHMS VISUALIZATION." Herald of Khmelnytskyi National University 303, no. 6 (December 2021): 81–85. http://dx.doi.org/10.31891/2307-5732-2021-303-6-81-85.

Повний текст джерела
Анотація:
Algorithms on graphs represented by graphical structures are offered. The software complex has a modular web interface. A representative graph is implemented as a set of vertices in the form of numbered circles and links between them (graphic image); using dynamically linked lists (adjacency lists); using an adjacency matrix. The project of this project allows the use of interactive algorithms for step-by-step calculations and algorithms on graphical images to obtain the necessary research results and competencies in the use of discrete structures. The project was implemented using HTML, CSS, JavaScript, which allows visualizing the application and interactively working with algorithms on graphs represented by different data structures. Graphics File Algorithm Programming provides web-based and interactive algorithms created by the used DHTML itself, creating a software project in the form of a site. Each page is dedicated to a separate algorithm and structurally consists of a header, container, footer. The website design uses HTML and cascading CSS stylesheets, to create an interactive parsing process and to transform methods in graphic files – based on JavaScript, which allows third-party scripts to be processed and rendered. The user can vibrate the image type (for orientation), the number of nodes, the presentation method, generate this graph, indicate the starting point for starting the search algorithm, observe the operational operation of the algorithm. The user can adjust the animation speed. The development of a set of programs is meant for interactive demonstration and visualization of the operation of algorithms in the study of graph theory.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Kim, Taekhee, Kwonyong Lee, Junhee Lee, Sungyong Park, Young Hwa Kim, and Byungjoon Lee. "A Dynamic Timeout Control Algorithm in Software Defined Networks." International Journal of Future Computer and Communication 3, no. 5 (October 2014): 331–36. http://dx.doi.org/10.7763/ijfcc.2014.v3.321.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Kotyk, Vladyslav, and Oksana Lashko. "Software Implementation of Gesture Recognition Algorithm Using Computer Vision." Advances in Cyber-Physical Systems 6, no. 1 (January 23, 2021): 21–26. http://dx.doi.org/10.23939/acps2021.01.021.

Повний текст джерела
Анотація:
This paper examines the main methods and principles of image formation, display of the sign language recognition algorithm using computer vision to improve communication between people with hearing and speech impairments. This algorithm allows to effectively recognize gestures and display information in the form of labels. A system that includes the main modules for implementing this algorithm has been designed. The modules include the implementation of perception, transformation and image processing, the creation of a neural network using artificial intelligence tools to train a model for predicting input gesture labels. The aim of this work is to create a full-fledged program for implementing a real-time gesture recognition algorithm using computer vision and machine learning.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Jayasudha, R., S. Subramanian, and L. Sivakumar. "Genetic Algorithm and PSO Based Intelligent Software Reuse." Applied Mechanics and Materials 573 (June 2014): 612–17. http://dx.doi.org/10.4028/www.scientific.net/amm.573.612.

Повний текст джерела
Анотація:
Software Reuse can improve the development time, cost and quality of Software artifacts. The Storage of artifacts plays an important role of easy retrieval of the needed components according to the requirement. In this paper a great measure has been taken for the retrieval of relevant component from the Ontology based repository. Two famous evolutionary algorithms Genetic Algorithm and Particle Swarm Optimization algorithm were used for extraction of needed component. These two algorithms are separately used for component retrieval. Genetic Algorithm in Component Retrieval is best suited if the repository has more number of relevant components. PSO for Component search is best suited if the query is highly refined to get more relevant document. PSO is used for the mainly query expansion. These two methods are combined first the retrieved set of component is organized with the help of GA and PSO for best query expansion. Thus these two methods are combined for best precision and retrieval time for different sets of requirement query
Стилі APA, Harvard, Vancouver, ISO та ін.
9

YAMAZAKI, Kazuo. "PID digital software control algorithm." Journal of the Robotics Society of Japan 7, no. 3 (1989): 218–24. http://dx.doi.org/10.7210/jrsj.7.3_218.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Rogaway, Phillip, and Don Coppersmith. "A Software-Optimized Encryption Algorithm." Journal of Cryptology 11, no. 4 (September 1998): 273–87. http://dx.doi.org/10.1007/s001459900048.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "Software algorithm"

1

Dementiev, Roman. "Algorithm engineering for large data sets hardware, software, algorithms." Saarbrücken VDM, Müller, 2006. http://d-nb.info/986494429/04.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Dementiev, Roman. "Algorithm engineering for large data sets : hardware, software, algorithms /." Saarbrücken : VDM-Verl. Dr. Müller, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=3029033&prov=M&dok_var=1&dok_ext=htm.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Ramage, Stephen Edward Andrew. "Advances in meta-algorithmic software libraries for distributed automated algorithm configuration." Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/52809.

Повний текст джерела
Анотація:
A meta-algorithmic procedure is a computer procedure that operates upon another algorithm and its associated design space to produce another algorithm with desirable properties (e.g., faster runtime, better solution quality, ...; see e.g., Hoos [2008]). Many meta-algorithmic procedures have runtimes that are dominated by the runtime of the algorithm being operated on. This holds in particular for automatic algorithm configurators, such as ParamILS, SMAC, and GGA, which serve to optimize the design (expressed through user settable parameters) of an algorithm under certain use cases. Consequently, one can gain improved performance of the meta-algorithm if evaluations of the algorithm under study can be done in parallel. In this thesis, we explore a distributed version of the automatic configurator, SMAC, called pSMAC, and the library, AEATK, that it was built upon, which has proved general and versatile enough to support many other meta-algorithmic procedures.
Science, Faculty of
Computer Science, Department of
Graduate
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Berry, Thomas. "Algorithm engineering : string processing." Thesis, Liverpool John Moores University, 2002. http://researchonline.ljmu.ac.uk/4973/.

Повний текст джерела
Анотація:
The string matching problem has attracted a lot of interest throughout the history of computer science, and is crucial to the computing industry. The theoretical community in Computer Science has a developed a rich literature in the design and analysis of string matching algorithms. To date, most of this work has been based on the asymptotic analysis of the algorithms. This analysis rarely tell us how the algorithm will perform in practice and considerable experimentation and fine-tuning is typically required to get the most out of a theoretical idea. In this thesis, promising string matching algorithms discovered by the theoretical community are implemented, tested and refined to the point where they can be usefully applied in practice. In the course of this work we have presented the following new algorithms. We prove that the time complexity of the new algorithms, for the average case is linear. We also compared the new algorithms with the existing algorithms by experimentation. " We implemented the existing one dimensional string matching algorithms for English texts. From the findings of the experimental results we identified the best two algorithms. We combined these two algorithms and introduce a new algorithm. " We developed a new two dimensional string matching algorithm. This algorithm uses the structure of the pattern to reduce the number of comparisons required to search for the pattern. " We described a method for efficiently storing text. Although this reduces the size of the storage space, it is not a compression method as in the literature. Our aim is to improve both space and time taken by a string matching algorithm. Our new algorithm searches for patterns in the efficiently stored text without decompressing the text. " We illustrated that by pre-processing the text we can improve the speed of the string matching algorithm when we search for a large number of patterns in a given text. " We proposed a hardware solution for searching in an efficiently stored DNA text.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Couto, Rafael Carvalho. "Desenvolvimento e aplicação do software MGA (Molecular Genetic Algorithm)." Universidade Federal de Goiás, 2013. http://repositorio.bc.ufg.br/tede/handle/tede/7512.

Повний текст джерела
Анотація:
Submitted by JÚLIO HEBER SILVA (julioheber@yahoo.com.br) on 2017-06-26T18:28:31Z No. of bitstreams: 2 Dissertação - Rafael Carvalho Couto - 2013.pdf: 41193945 bytes, checksum: 74a020dad23640afb84a085b841b91aa (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Approved for entry into archive by Cláudia Bueno (claudiamoura18@gmail.com) on 2017-07-07T20:26:09Z (GMT) No. of bitstreams: 2 Dissertação - Rafael Carvalho Couto - 2013.pdf: 41193945 bytes, checksum: 74a020dad23640afb84a085b841b91aa (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Made available in DSpace on 2017-07-07T20:26:10Z (GMT). No. of bitstreams: 2 Dissertação - Rafael Carvalho Couto - 2013.pdf: 41193945 bytes, checksum: 74a020dad23640afb84a085b841b91aa (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2013-04-15
This work focuses on the development of the software MGA, which aims to determine the lowest energy structures of a given molecular system, using Genetic Algorithm (GA). The GA is a method of artificial intelligence that was developed to work with finding the best solutions of the specified conditions, ie, an algorithm that seeks the best answer desired, an optimal result. The MGA uses three techniques: Random Search (RS), Noninclusive Genetic Algorithm (NGA), Inclusive Genetic Algorithm (IGA). The last one is characterized by a new type of evolutionary strategy that allows in a single calculation and a single cycle, obtain several minimum of the potential energy surface. For optimum operation of the algorithm, was made an optimization of the parameters used in MGA, through response surface methodology. Using the techniques RS, IGA and NGA, were determined 141 distinct molecular structures of the amino acid asparagine. In the electronic structure calculations were considered the semi-empirical methods PM3, AM1 and RM1; and DFT potentials, with basis sets 6-311G ** and PC1. The RS determined the Global Minimum (GM) with ease, for the different potentials used, and proved that it’s quite useful in determining molecular geometries where there is no accuracy in the determination of local minima in order of energy. The NGA is efficient in determining the GM, performing in a shorter time, if compared to RS and IGA. The IGA proved to be a more robust method than the others, because in addition to determining the GM, it can find the local minima in order of energy. Performing calculations on an intermediate time of RS and NGA, the IGA determined the GM as the NGA, and found structures that were not founded using RS. The GM’s of asparagine determined using the potentials PC1, PM3, AM1 and RM1 have a large structural difference. This demonstrates that different potencials used in the electronic structure calculations may lead to different results. By analyzing the structures obtained for potentials PC1, PM3, AM1 and RM1, using the IGA, it appears that there is a difference in the topology of the potential energy surface of these potentials.
O presente trabalho é focado no desenvolvimento do software MGA, que tem como objetivo a determinação das estruturas de menor energia de um dado sistema molecular, utilizando o Algoritmo Genético (AG). O AG é um método de inteligência artificial que foi desenvolvido para trabalhar com a procura de soluções que melhor atendam as condições especificadas, isto é, um algoritmo que procura a melhor resposta desejada, um resultado ótimo. O MGA utiliza três técnicas: Busca Aleatória (RS), Algoritmo Genético Não-inclusivo (NGA), Algoritmo Genético Inclusivo (IGA). Este último é caracterizado por um novo tipo de estratégia evolutiva que permite em um único cálculo e um único ciclo evolucionário obter diversos mínimos da superfície de energia potencial. Para o melhor funcionamento do algoritmo, foi feita uma otimização dos parâmetros utilizados do MGA, através da metodologia de superfície de resposta. Utilizando as técnicas RS, NGA e IGA, foram determinadas 141 estruturas moleculares distintas do aminoácido asparagina. Nos cálculos de estrutura eletrônica foram considerados os métodos semi-empíricos PM3, AM1 e RM1; e potenciais DFT, com os conjuntos de base 6-311G** e PC1. O RS determinou o Mínimo Global (GM) com facilidade, para os diferentes potenciais utilizados, e se mostrou bastante útil na determinação de geometrias moleculares onde não há um rigor na determinação de mínimos locais em ordem de energia. O NGA é eficiente na determinaçãoao do GM, realizando em um menor tempo, se comparado ao RS e IGA. O IGA mostrou-se um método mais robusto que os outros, pois além de determinar o GM é possível encontrar os mínimos locais em ordem de energia. Realizando cálculos em um tempo intermediário ao RS e NGA, o IGA determinou o GM assim como o NGA, e encontrou estruturas que não foram possíveis utilizando o RS. Os GM’s da asparagina determinados utilizando os potenciais PC1, PM3, AM1 e RM1 possuem uma grande diferença estrutural. Isto demonstra que diferentes potencias utilizados nos cálculos de estrutura eletrônica podem levar a diferentes resultados. Ao analisarmos as estruturas obtidas para os potenciais PC1, PM3, AM1 e RM1, utilizando o IGA, constata-se que há uma diferença na topologia de suas superfícies de energia potencial.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Panella, Nicola. "Software implementation of a BMS algorithm for automotive application." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2022.

Знайти повний текст джерела
Анотація:
This work aims to provide a solid understanding of the Simulink Model Based Design development process of a BMS algorithm, with the help of an example implementation of a Software Component (SWC) on the Micro Controller Unit (MCU). All SWCs are developed in Simulink environment using a specific workflow and toolset: Simulink Embedded Coder will then generate the C code which will be implemented in the MCU programming software. The introduction will cover basic control functions required by the BMS system to effectively monitor the battery pack of an automotive application, implementing a variety of safety procedures. The following section explains in detail the actual development of the sample SWC according to the Model Based Design Workflow presented: key factors of the development are Requirement Based Verification and Testing and Unit Testing implementation. This workflow’s toolset allows the development team to access sparse information providing a consistent linkage between multiple documented requirements and the programming environment. As a result, all the required information regarding every Unit or “module” is accessed within the Simulink interface. Error detection during development is greatly enhanced. This aspect is extremely important with regards to the debug process: the more the project in development is at the end of its life cycle (towards the client acceptance phase), the higher the bug fix cost results. Furthermore, some useful Simulink Add-Ons can perform compliance tests towards a collection of selected regulations as, inter alia, ISO 26262 “Road Vehicles – Functional Safety” Standard. Limitations imposed by integrated regulations during components’ development can ultimately facilitate the required certification and approval by competent authorities.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Gross, Hans-Gerhard. "Measuring evolutionary testability of real-time software." Thesis, University of South Wales, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365087.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

McLoone, M. P. "Generic silicon architectures for encryption algorithm." Thesis, Queen's University Belfast, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.269123.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Jung, Young Je. "Data compression and archiving software implementation and their algorithm comparison." Thesis, Monterey, California. Naval Postgraduate School, 1992. http://hdl.handle.net/10945/26958.

Повний текст джерела
Анотація:
Although data compression has been studied for over 30 years, many new techniques are still evolving. There is considerable software available that incorporates compression schemes and archiving techniques. The U.S. Navy is interested in knowing the performance of this software. This thesis studies and compares the software. The testing files consist of the file types specified by the U.S. Naval Security Detachment at Pensacola, Florida
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Benage, William Fred. "A fault-tolerant software algorithm for a network of transputers." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/27051.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "Software algorithm"

1

Jung, Young Je. Data compression and archiving software implementation and their algorithm comparison. Monterey, Calif: Naval Postgraduate School, 1992.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Benage, William Fred. A fault-tolerant software algorithm for a network of transputers. Monterey, Calif: Naval Postgraduate School, 1989.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

1964-, Fleischer Rudolf, Moret B. M. E, and Schmidt E. M. 1945-, eds. Experimental algorithmics: From algorithm design to robust and efficient software. New York: Springer, 2002.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Gregg, David J. An alias analysis algorithm for object-oriented programs. Dublin: University College Dublin, 1996.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Md.) Workshop on Algorithm Engineering and Experiments (5th 2003 Baltimore. Proceedings of the fifth Workshop on Algorithm Engineering and Experiments. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2003.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

service), SpringerLink (Online, ed. Algorithm Theory – SWAT 2008: 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008. Proceedings. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2008.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

The simple genetic algorithm: Foundations and theory. Cambridge, Mass: MIT Press, 1999.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Elliott, Donald M. Application of a genetic algorithm to optimize quality assurance in software development. Monterey, Calif: Naval Postgraduate School, 1993.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

International Workshop on Algorithm Engineering (5th 2001 Aarhus, Denmark). Algorithm engineering: 5th International Workshop, WAE 2001, Aarhus, Denmark, August 28-21, 2001 : proceedings. New York: Springer, 2001.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Ramamurthy, Karthikeyan N. MATLAB software for the code excited linear prediction algorithm: The Federal Standard, 1016. San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA): Morgan & Claypool Publishers, 2010.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "Software algorithm"

1

Cooke, D. John. "Algorithm Extraction." In Constructing Correct Software, 149–215. London: Springer London, 1998. http://dx.doi.org/10.1007/978-1-4471-3985-0_6.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Kerren, Andreas, and John T. Stasko. "Chapter 1 Algorithm Animation." In Software Visualization, 1–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45875-1_1.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Fleischer, Rudolf, and Luděk Kučera. "Algorithm Animation for Teaching." In Software Visualization, 113–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45875-1_9.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Courtois, Nicolas T., Pouyan Sepehrdad, Petr Sušil, and Serge Vaudenay. "ElimLin Algorithm Revisited." In Fast Software Encryption, 306–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34047-5_18.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Rivest, Ronald L. "The RC5 encryption algorithm." In Fast Software Encryption, 86–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60590-8_7.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Francik, Jarosław. "Algorithm Animation Using Data Flow Tracing." In Software Visualization, 73–87. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45875-1_6.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Gutwenger, Carsten, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, and Petra Mutzel. "Graph Drawing Algorithm Engineering with AGD." In Software Visualization, 307–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45875-1_24.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Tal, Ayellet. "Algorithm Animation Systems for Constrained Domains." In Software Visualization, 101–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45875-1_8.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Matsui, Mitsuru. "New block encryption algorithm MISTY." In Fast Software Encryption, 54–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0052334.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Wheeler, David J., and Roger M. Needham. "TEA, a tiny encryption algorithm." In Fast Software Encryption, 363–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60590-8_29.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Software algorithm"

1

Kopyltsov, A. V., and A. A. Kopyltsov. "ALGORITHM FOR EVALUATING THE QUALITY OF SOFTWARE PRODUCTS." In MODELING AND SITUATIONAL MANAGEMENT THE QUALITY OF COMPLEX SYSTEMS. Saint Petersburg State University of Aerospace Instrumentation, 2021. http://dx.doi.org/10.31799/978-5-8088-1558-2-2021-2-57-61.

Повний текст джерела
Анотація:
An algorithm for evaluating the quality of software products is proposed, which includes two levels. At the first level, indicators are considered: operational efficiency, memory efficiency, error tolerance, unified communication procedures, data uniformity, traceability, consistency, information input and output speed, robustness, accuracy, access control, redistribution, availability, simplicity, information input and output volume, community, independence from other software, the availability of measuring tools, modularity, machine independence, brevity, access control, communication, informational content, completeness, the possibility of training. Applying the convolution algorithm to indicators of the first level, we can obtain indicators of the second level: efficiency, integrity, ease of use, practicality, evaluation, reliability, mobility, correctness, flexibility, the ability to use in other conditions, the possibility of interaction, security. Applying the convolution algorithm to the indicators of the second level, we can evaluate the quality of software. The convolution algorithm is the sum of indicators with weighting factors. The difference from other algorithms is that the coefficients are not calculated. Coefficients are subject to conditions. Firstly, the discreteness condition, i.e. coefficients can take only discrete values with a predetermined step. Secondly, the normalization condition, i.e. the sum of all the coefficients is equal to one. Thirdly, the priority condition, i.e. all coefficients are arranged in increasing order. Using this algorithm, we obtain several convolution values. The final result of the convolution will be their arithmetic mean. Using this algorithm, you can evaluate the quality of both software products and other products and services. In particular, this algorithm can be applied to assess the quality of educational services, medical services, etc.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Trimananda, Rahmadi, and Yeoh Chiah Kuang. "A software aided algorithm analysis." In 2014 International Electrical Engineering Congress (iEECON). IEEE, 2014. http://dx.doi.org/10.1109/ieecon.2014.6925865.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Hoshyar, R. "Software reconfigurability - algorithm level approach." In Fourth International Conference on 3G Mobile Communication Technologies. IEE, 2003. http://dx.doi.org/10.1049/cp:20030348.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Zhu, Jianpeng, Jun Xiao, and Ying Wang. "A Fragile Software Watermarking Algorithm for Software Configuration Management." In 2009 International Conference on Multimedia Information Networking and Security. IEEE, 2009. http://dx.doi.org/10.1109/mines.2009.216.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Fang, Zhenman, Donglei Yang, Weihua Zhang, Haibo Chen, and Binyu Zang. "A comprehensive analysis and parallelization of an image retrieval algorithm." In Software (ISPASS). IEEE, 2011. http://dx.doi.org/10.1109/ispass.2011.5762732.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Pervez, Zeeshan, Noor-ul-Qayyum, Yasir Mahmood, and Hafiz Farooq Ahmad. "Semblance based disseminated software watermarking algorithm." In 2008 23rd International Symposium on Computer and Information Sciences (ISCIS). IEEE, 2008. http://dx.doi.org/10.1109/iscis.2008.4717945.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Leth, Tobias, Christoffer Sloth, and Rafal Wisniewski. "Lyapunov function synthesis — Algorithm and software." In 2016 IEEE Conference on Computer Aided Control System Design (CACSD). IEEE, 2016. http://dx.doi.org/10.1109/cacsd.2016.7602539.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Carroll, Martin, and Barbara G. Ryder. "An incremental algorithm for software analysis." In the second ACM SIGSOFT/SIGPLAN software engineering symposium. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/24208.24228.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Dongxin, Shi, Yang Zhanxin, Niu Lipi, and Wang Feifei. "Raptor algorithm optimization with software coding." In 2014 International Conference on Information Science, Electronics and Electrical Engineering (ISEEE). IEEE, 2014. http://dx.doi.org/10.1109/infoseee.2014.6947879.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Lopes, Rodolfo Ayala, Thiago Macedo Gomes, and Alan Robert Resende de Freitas. "A symbolic evolutionary algorithm software platform." In GECCO '19: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3319619.3326828.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Software algorithm"

1

Sadeghi, Leila, Yaguang Zhang, Andrew Balmos, James Krogmeier, and John Haddock. Algorithm and Software for Proactive Pothole Repair. Purdue University, November 2016. http://dx.doi.org/10.5703/1288284316337.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Gerth, Wayne A. Thalmann Algorithm Decompression Table Generation Software Design Document. Fort Belvoir, VA: Defense Technical Information Center, September 2010. http://dx.doi.org/10.21236/ada549883.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Cummins, J. L. CMM functional software evaluation (algorithm qualification). Final report. Office of Scientific and Technical Information (OSTI), January 1995. http://dx.doi.org/10.2172/10115647.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Pirohov, Vladyslav M., Anna M. Horlo, and Iryna S. Mintii. Software development of the algorithm of adaptating of the website design for people with color-blindness. [б. в.], December 2018. http://dx.doi.org/10.31812/123456789/2888.

Повний текст джерела
Анотація:
The purpose of the study is the program implementation of the basic algorithms of the website design adaptation for people with color perception. This article examines the implementation of the following algorithms: the conversion algorithm from the rgb color model to the lms model (there is a special algorithm precisely in the color model lms for modeling various types of color perception violations), simulation of different color blindness types in the lms-model (this is the transformation of normal values in the color model lms to values with different types of color perception violations), convert data from lms color model to rgb model, conversion from color rgb to hsl model, color filtering in hsl-model and conversion from hsl model to rgb color model.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Monterial, M., K. Nelson, S. Labov, and S. Sangiorgio. Software Requirements Document: Benchmarking Algorithm for RadioNuclide Identification (BARNI). Office of Scientific and Technical Information (OSTI), July 2020. http://dx.doi.org/10.2172/1650465.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Sak-Sakovskii, V. I., V. M. Stoliarov, I. N. Fedotov, and V. V. Kobelev. Software implementation of the algorithm for rational distribution of elements. OFERNIO, October 2020. http://dx.doi.org/10.12731/ofernio.2020.24642.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Jones, Sean A., and Donald M. Needham. An Algorithm for Improving System Safety via Software Fault Trees. Fort Belvoir, VA: Defense Technical Information Center, May 2005. http://dx.doi.org/10.21236/ada460495.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Cui, Yonggang. Using Deep Learning Algorithm to Enhance Image-review Software for Surveillance Cameras. Office of Scientific and Technical Information (OSTI), October 2018. http://dx.doi.org/10.2172/1477475.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Cui, Yonggang, and Maikael A. Thomas. Using Deep Learning Algorithm to Enhance Image-review Software for Surveillance Cameras. Office of Scientific and Technical Information (OSTI), May 2018. http://dx.doi.org/10.2172/1436246.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Cui, Y. Using Deep Learning Algorithm to Enhance Image-review Software for Surveillance Cameras. Office of Scientific and Technical Information (OSTI), November 2017. http://dx.doi.org/10.2172/1413952.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Software algorithm" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії