Gotowe bibliografie tematyczne / Algorithm efficiency

Spis treści

Artykuły w czasopismach
Rozprawy doktorskie
Książki
Części książek
Streszczenia konferencji
Raporty organizacyjne

Gotowa bibliografia na temat „Algorithm efficiency”

Autor: Grafiati

Data publikacji: 31 sierpnia 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Algorithm efficiency”.

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 "Algorithm efficiency"

Sergienko, Ivan, Vladimir Shylo, Valentyna Roshchyn i Petro Shylo. "The Efficiency of Discrete Optimization Algorithm Portfolios". Cybernetics and Computer Technologies, nr 2 (30.06.2021): 5–12. http://dx.doi.org/10.34229/2707-451x.21.2.1.

Pełny tekst źródła

Streszczenie:

Introduction. Solving large-scale discrete optimization problems requires the processing of large-scale data in a reasonable time. Efficient solving is only possible by using multiprocessor computer systems. However, it is a daunting challenge to adapt existing optimization algorithms to get all the benefits of these parallel computing systems. The available computational resources are ineffective without efficient and scalable parallel methods. In this connection, the algorithm unions (portfolios and teams) play a crucial role in the parallel processing of discrete optimization problems. The purpose. The purpose of this paper is to research the efficiency of the algorithm portfolios by solving the weighted max-cut problem. The research is carried out in two stages using stochastic local search algorithms. Results. In this paper, we investigate homogeneous and non-homogeneous algorithm portfolios. We developed the homogeneous portfolios of two stochastic local optimization algorithms for the weighted max-cut problem, which has numerous applications. The results confirm the advantages of the proposed methods. Conclusions. Algorithm portfolios could be used to solve well-known discrete optimization problems of unprecedented scale and significantly improve their solving time. Further, we propose using communication between algorithms, namely teams and portfolios of algorithm teams. The algorithms in a team communicate with each other to boost overall performance. It is supposed that algorithm communication allows enhancing the best features of the developed algorithms and would improve the computational times and solution quality. The underlying algorithms should be able to utilize relevant data that is being communicated effectively to achieve any computational benefit from communication. Keywords: Discrete optimization, algorithm portfolios, computational experiment.

Style APA, Harvard, Vancouver, ISO itp.

Zarembo, Imants, i Sergejs Kodors. "Pathfinding Algorithm Efficiency Analysis in 2D Grid". Environment. Technology. Resources. Proceedings of the International Scientific and Practical Conference 2 (8.08.2015): 46. http://dx.doi.org/10.17770/etr2013vol2.868.

Pełny tekst źródła

Streszczenie:

The main goal of this paper is to collect information about pathfinding algorithms A*, BFS, Dijkstra's algorithm, HPA* and LPA*, and compare them on different criteria, including execution time and memory requirements. Work has two parts, the first being theoretical and the second practical. The theoretical part details the comparison of pathfinding algorithms. The practical part includes implementation of specific algorithms and series of experiments using algorithms implemented. Such factors as various size two dimensional grids and choice of heuristics were taken into account while conducting experiments.

Style APA, Harvard, Vancouver, ISO itp.

Zhi, Xiangyu, Xiao Yan, Bo Tang, Ziyao Yin, Yanchao Zhu i Minqi Zhou. "CoroGraph: Bridging Cache Efficiency and Work Efficiency for Graph Algorithm Execution". Proceedings of the VLDB Endowment 17, nr 4 (grudzień 2023): 891–903. http://dx.doi.org/10.14778/3636218.3636240.

Pełny tekst źródła

Streszczenie:

Many systems are designed to run graph algorithms efficiently in memory but they achieve only cache efficiency or work efficiency. We tackle this fundamental trade-off in existing systems by designing CoroGraph, a system that attains both cache efficiency and work efficiency for in-memory graph processing. CoroGraph adopts a novel hybrid execution model , which generates update messages at vertex granularity to prioritize promising vertices for work efficiency, and commits updates at partition granularity to share data access for cache efficiency. To overlap the random memory access of graph algorithms with computation, CoroGraph extensively uses coroutine , i.e., a lightweight function in C++ that can yield and resume with low overhead, to prefetch the required data. A suite of designs are incorporated to reap the full benefits of coroutine, which include prefetch pipeline, cache-friendly graph format, and stop-free synchronization. We compare CoroGraph with five state-of-the-art graph algorithm systems via extensive experiments. The results show that CoroGraph yields shorter algorithm execution time than all baselines in 18 out of 20 cases, and its speedup over the best-performing baseline can be over 2x. Detailed profiling suggests that CoroGraph achieves both cache efficiency and work efficiency with a low memory stall and a small number of processed edges.

Style APA, Harvard, Vancouver, ISO itp.

Brandejsky, Tomas. "Function Set Structure Influence onto GPA Efficiency". MENDEL 23, nr 1 (1.06.2017): 29–32. http://dx.doi.org/10.13164/mendel.2017.1.029.

Pełny tekst źródła

Streszczenie:

The paper discusses the influence of function set structure onto efficiency of GPA (Genetic Programming Algorithms), and hierarchical algorithms like GPA-ES (GPA with Evolutionary Strategy to separate parameter optimization) algorithm efficiency. On the foreword, the discussed GPA algorithm is described. Then there is depicted function set and common requirements to its structure. On the end of this contribution, the test examples and environment as well as results of measurement of influence of superfluous functions presence in the used function set is discussed.

Style APA, Harvard, Vancouver, ISO itp.

Klyatchenko, Yaroslav, i Volodymyr Holub. "EFFICIENCY OF LOSSLESS DATA COMPRESSION ALGORITHM MODIFICATION". Bulletin of National Technical University "KhPI". Series: System Analysis, Control and Information Technologies, nr 2 (10) (19.12.2023): 67–72. http://dx.doi.org/10.20998/2079-0023.2023.02.10.

Pełny tekst źródła

Streszczenie:

The current level of development of information technologies causes a rapid increase in the amount of information stored, transmitted and processed in computer systems. Ensuring the full and effective use of this information requires the use of the latest improved algorithms for compaction and optimization of its storage. The further growth of the technical level of hardware and software is closely related to the problems of lack of memory for storage, which also actualizes the task of effective data compression. Improved compression algorithms allow more efficient use of storage resources and reduce data transfer time over the network. Every year, programmers, scientists, and researchers look for ways to improve existing algorithms, as well as invent new ones, because every algorithm, even if it is simple, has its potential for improvement. A wide range of technologies related to the collection, processing, storage and transmission of information are largely oriented towards the development of systems in which graphical presentation of information has an advantage over other types of presentation. The development of modern computer systems and networks has influenced the wide distribution of tools operating with digital images. It is clear that storing and transferring a large number of images in their original, unprocessed form is a rather resource-intensive task. In turn, modern multimedia systems have gained considerable popularity thanks, first of all, to effective means of compressing graphic information. Image compression is a key factor in improving the efficiency of data transfer and the use of computing resources. The work is devoted to the study of the modification of the data compression algorithm The Quite OK Image Format, or QOI, which is optimized for speed for the compression of graphic information. Testing of those implementations of the algorithm, which were proposed by its author, shows such encouraging results that it can make it competitive with the already known PNG algorithm, providing a higher compression speed and targeting work with archives. The article compares the results of the two proposed modifications of the algorithm with the original implementation and shows their advantages. The effectiveness of the modifications and the features of their application for various cases were evaluated. A comparison of file compression coefficients, which were compressed by the original QOI algorithm, with such coefficients, which were obtained as a result of the application of modifications of its initial version, was also carried out.

Style APA, Harvard, Vancouver, ISO itp.

Xiao, Shi Song, Ao Lin Wang i Hui Feng. "An Improved Algorithm Based on AC-BM Algorithm". Applied Mechanics and Materials 380-384 (sierpień 2013): 1576–79. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.1576.

Pełny tekst źródła

Streszczenie:

The pattern matching algorithm is the mainstream technology in the instruction detection system, and therefore as a pattern-matching methods core string matching algorithm directly affect an intrusion detection system performance and efficiency. So based on the discussions of the most fashionable pattern matching algorithms at present, an improved algorithm of AC-BM is presented. From the experiments in the Snort ,it is concluded that the improved algorithm of the performance and efficiency is higher than AC-BM algorithm.

Style APA, Harvard, Vancouver, ISO itp.

Gracios, Anita, i Prof Arun Jhapate. "An Effective Routing Algorithm to Enhance Efficiency with WSN". International Journal of Trend in Scientific Research and Development Volume-2, Issue-3 (30.04.2018): 301–4. http://dx.doi.org/10.31142/ijtsrd10879.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Zaharov, D. O., i A. P. Karpenko. "Study of League Championship Algorithm Efficiency for Global Optimization Problem". Mathematics and Mathematical Modeling, nr 2 (9.06.2020): 25–45. http://dx.doi.org/10.24108/mathm.0220.0000217.

Pełny tekst źródła

Streszczenie:

The article objective is to study a new League Championship Algorithm (LCA) algorithm efficiency by its comparing with the efficiency of the Particle Swarm optimization (PSO) algorithm.The article presents a brief description of the terms used in the League Championship algorithm, describes the basic rules of the algorithm, on the basis of which the iterative process for solving the global optimization problem is built.Gives a detailed description of the League Championship algorithm, which comprises a flowchart of the algorithm, as well as a formalization of all its main steps.Depicts an exhaustive description of the software developed to implement the League Championship algorithm to solve global optimization problems.Briefly describes the modified particle swarm algorithm. Presents the values of all free parameters of the algorithm and the algorithm modifications, which make it different from the classical version, as well.The main part of the article shows the results of a great deal of computational experiments using two abovementioned algorithms. All the performance criteria, used for assessment of the algorithms efficiency, are given.Computational experiments were performed using the spherical function, as well as the Rosenbrock, Rastrigin, and Ackley functions. The results of the experiments are summarized in Tables, and also illustrated in Figures. Experiments were performed for the vector dimension of the variable parameters that is equal to 2, 4, 8, 16, 32, and 64.An analysis of the results of computational experiments involves a full assessment of the efficiency of the League Championship algorithm, and also provides an answer about expediency for further algorithm development.It is shown that the League Championship algorithm presented in the article has a high development potential and needs further work for its study.

Style APA, Harvard, Vancouver, ISO itp.

Wang, Chun Ye, i Xiao Feng Zhou. "The MapReduce Parallel Study of KNN Algorithm". Advanced Materials Research 989-994 (lipiec 2014): 2123–27. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.2123.

Pełny tekst źródła

Streszczenie:

Although the parallelization KNN algorithm improves the classification efficiency of the algorithm, the calculation of the parallel algorithms increases with the increasing of the training sample data scale, affecting the classification efficiency of the algorithm. Aiming at this shortage, this paper will improve the original parallelization KNN algorithm in the MapReduce model, adding the text pretreatment process to improve the classification efficiency of the algorithm.

Style APA, Harvard, Vancouver, ISO itp.

Yang, Wen Jun. "Efficient Pattern Matching Algorithm for Intrusion Detection Systems". Applied Mechanics and Materials 511-512 (luty 2014): 1178–84. http://dx.doi.org/10.4028/www.scientific.net/amm.511-512.1178.

Pełny tekst źródła

Streszczenie:

To overcome the defects of low efficiency of pattern matching in intrusion detection systems (IDS), an efficient pattern matching algorithm is proposed. The proposed algorithm first preprocesses pattern to record pattern information, then it recursive compares the nodes to find the most common part of pattern to improve efficiency. The proposed algorithm also appends auxiliary structure of m nodes in pattern to reduce time and space complexity. Theoretical analysis shows that for the subject with n nodes, the time complexity of the proposed algorithm is, and space complexity is . Detailed experimental results and comparisons with existed algorithms show that the proposed algorithm outperforms current state-of-the-art algorithms in terms of time efficiency, space efficiency and matching ratio.

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Rozprawy doktorskie na temat "Algorithm efficiency"

Morgan, Wiley Spencer. "Increasing the Computational Efficiency of Combinatoric Searches". BYU ScholarsArchive, 2016. https://scholarsarchive.byu.edu/etd/6528.

Pełny tekst źródła

Streszczenie:

A new algorithm for the enumeration of derivative superstructures of a crystal is presented. The algorithm will help increase the efficiency of computational material design methods such as cluster expansion by increasing the size and diversity of the types of systems that can be modeled. Modeling potential alloys requires the exploration of all possible configurations of atoms. Additionally, modeling the thermal properties of materials requires knowledge of the possible ways of displacing the atoms. One solution to finding all symmetrically unique configurations and displacements is to generate the complete list of possible configurations and remove those that are symmetrically equivalent. This approach, however, suffers from the combinatoric explosion that happens when the supercell size is large, when there are more than two atom types, or when atomic displacements are included in the system. The combinatoric explosion is a problem because the large number of possible arrangements makes finding the relatively small number of unique arrangements for these systems impractical. The algorithm presented here is an extension of an existing algorithm [Hart & Forcade (2008a), Hart & Forcade (2009a), Hart et al. (2012a) Hart, Nelson, & Forcade] to include the extra configurational degree of freedom from the inclusion of displacement directions. The algorithm makes use of another recently developed algorithm for the Pólya [Pólya & Read (1987), Pólya (1937), Rosenbrock et al.(2015) Rosenbrock, Morgan, Hart, Curtarolo, & Forcade] counting theorem to inform the user of the total number of unique arrangements before performing the enumeration and to ensure that the list of unique arrangements will fit in system memory. The algorithm also uses group theory to eliminate large classes of arrangements rather than eliminating arrangements one by one. The three major topics of this paper will be presented in this order, first the Pólya algorithm, second the new algorithm for eliminating duplicate structures, and third the algorithms extension to include displacement directions. With these tools, it is possible to avoid the combinatoric explosion and enumerate previously inaccessible systems, including those that contain displaced atoms.

Style APA, Harvard, Vancouver, ISO itp.

Batbayar, Batsukh, i S3099885@student rmit edu au. "Improving Time Efficiency of Feedforward Neural Network Learning". RMIT University. Electrical and Computer Engineering, 2009. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20090303.114706.

Pełny tekst źródła

Streszczenie:

Feedforward neural networks have been widely studied and used in many applications in science and engineering. The training of this type of networks is mainly undertaken using the well-known backpropagation based learning algorithms. One major problem with this type of algorithms is the slow training convergence speed, which hinders their applications. In order to improve the training convergence speed of this type of algorithms, many researchers have developed different improvements and enhancements. However, the slow convergence problem has not been fully addressed. This thesis makes several contributions by proposing new backpropagation learning algorithms based on the terminal attractor concept to improve the existing backpropagation learning algorithms such as the gradient descent and Levenberg-Marquardt algorithms. These new algorithms enable fast convergence both at a distance from and in a close range of the ideal weights. In particular, a new fast convergence mechanism is proposed which is based on the fast terminal attractor concept. Comprehensive simulation studies are undertaken to demonstrate the effectiveness of the proposed backpropagataion algorithms with terminal attractors. Finally, three practical application cases of time series forecasting, character recognition and image interpolation are chosen to show the practicality and usefulness of the proposed learning algorithms with comprehensive comparative studies with existing algorithms.

Style APA, Harvard, Vancouver, ISO itp.

Freund, Robert M. "Theoretical Efficiency of A Shifted Barrier Function Algorithm for Linear Programming". Massachusetts Institute of Technology, Operations Research Center, 1989. http://hdl.handle.net/1721.1/5185.

Pełny tekst źródła

Streszczenie:

This paper examines the theoretical efficiency of solving a standard-form linear program by solving a sequence of shifted-barrier problems of the form minimize cTx - n (xj + ehj) j.,1 x s.t. Ax = b , x + e h > , for a given and fixed shift vector h > 0, and for a sequence of values of > 0 that converges to zero. The resulting sequence of solutions to the shifted barrier problems will converge to a solution to the standard form linear program. The advantage of using the shiftedbarrier approach is that a starting feasible solution is unnecessary, and there is no need for a Phase I-Phase II approach to solving the linear program, either directly or through the addition of an artificial variable. Furthermore, the algorithm can be initiated with a "warm start," i.e., an initial guess of a primal solution x that need not be feasible. The number of iterations needed to solve the linear program to a desired level of accuracy will depend on a measure of how close the initial solution x is to being feasible. The number of iterations will also depend on the judicious choice of the shift vector h . If an approximate center of the dual feasible region is known, then h can be chosen so that the guaranteed fractional decrease in e at each iteration is (1 - 1/(6 i)) , which contributes a factor of 6 ii to the number of iterations needed to solve the problem. The paper also analyzes the complexity of computing an approximate center of the dual feasible region from a "warm start," i.e., an initial (possibly infeasible) guess ir of a solution to the center problem of the dual. Key Words: linear program, interior-point algorithm, center, barrier function, shifted-barrier function, Newton step.

Style APA, Harvard, Vancouver, ISO itp.

Khudhair, Ali Dheyaa. "A Simplified Routing Algorithm for Energy Efficiency in Wireless Sensor Networks". Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1885751071&sid=8&Fmt=2&clientId=1509&RQT=309&VName=PQD.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Lindberg, Joakim, i Martin Steier. "Efficiency of the hybrid AC3-tabu search algorithm for solving Sudoku puzzles". Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166421.

Pełny tekst źródła

Streszczenie:

There are many different algorithms for solving Sudoku puzzles, with one of the newer algorithms being the hybrid AC3-tabu search algorithm. Since the algorithm has not been subject of much research, the aim of this thesis is to increase the knowledge of it. This thesis evaluates the efficiency of the hybrid AC3-tabu search algorithm by analyzing how quickly it solves puzzles compared to two other solving algorithms: one using brute-force search, and one combining human solving techniques with brute-force search. This thesis also investigates if there is a correlation between the number of puzzle clues and the solving time for the hybrid AC3-tabu search algorithm. The results show that the hybrid AC3-tabu search algorithm is less efficient than the two other algorithms, and that there seems to be a correlation between the number of clues and the solving time for the algorithm. The conclusion is that due to the algorithm’s low efficiency and some of its characteristics, it is not suitable for solving Sudoku puzzles.

Style APA, Harvard, Vancouver, ISO itp.

Chen, Daven 1959. "COMPARISON OF SCIRTSS EFFICIENCY WITH D-ALGORITHM APPLICATION TO ITERATIVE NETWORKS (TEST)". Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/275572.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Burger, Christoph Hartfield Roy J. "Propeller performance analys and multidisciplinary optimization using a genetic algorithm". Auburn, Ala, 2007. http://repo.lib.auburn.edu/2007%20Fall%20Dissertations/Burger_Christoph_57.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Selek, I. (István). "Novel evolutionary methods in engineering optimization—towards robustness and efficiency". Doctoral thesis, University of Oulu, 2009. http://urn.fi/urn:isbn:9789514291579.

Pełny tekst źródła

Streszczenie:

Abstract In industry there is a high demand for algorithms that can efficiently solve search problems. Evolutionary Computing (EC) belonging to a class of heuristics are proven to be well suited to solve search problems, especially optimization tasks. They arrived at that location because of their flexibility, scalability and robustness. However, despite their advantages and increasing popularity, there are numerous opened questions in this research area, many of them related to the design and tuning of the algorithms. A neutral technique called Pseudo Redundancy and related concepts such as Updated Objective Grid (UOG) is proposed to tackle the mentioned problem making an evolutionary approach more suitable for ''real world'' applications while increasing its robustness and efficiency. The proposed UOG technique achieves neutral search by objective function transformation(s) resulting several advantageous features. (a) Simplifies the design of an evolutionary solver by giving population sizing principles and directions to choose the right selection operator. (b) The technique of updated objective grid is adaptive without introducing additional parameters, therefore no parameter tuning required for UOG to adjust it for different environments, introducing robustness. (c) The algorithm of UOG is simple and computationally cheap. (d) It boosts the performance of an evolutionary algorithm on high dimensional (constrained and unconstrained) problems. The theoretical and experimental results from artificial test problems included in this thesis clearly show the potential of the proposed technique. In order to demonstrate the power of the introduced methods under "real" circumstances, the author additionally designed EAs and performed experiments on two industrial optimization tasks. Although, only one project is detailed in this thesis while the other is referred. As the main outcome of this thesis, the author provided an evolutionary method to compute (optimal) daily water pump schedules for the water distribution network of Sopron, Hungary. The algorithm is currently working in industry.

Style APA, Harvard, Vancouver, ISO itp.

Kassa, Hailu Belay, Shenko Chura Aredo i Estifanos Yohannes Menta. "ENERGY EFFICIENT ADAPTIVE SECTOR-BASED USER CLUSTERING ALGORITHM FOR CELLULAR NETWORK". International Foundation for Telemetering, 2016. http://hdl.handle.net/10150/624220.

Pełny tekst źródła

Streszczenie:

In this paper, we propose an adaptive and multi-sector-based user clustering algorithm which increases energy efficiency in a cellular network. Adaptive sectoring with dynamically changing sector angles is illustrated with a number of randomly distributed mobile stations. Transmitted power is equally shared by sectors before adaptive user clustering. The sector angles vary from 30 to 360 degrees by merging neighboring sectors and a sector is switched off till the user density exceeds a threshold (Td). The Td value is computed from the total number of users that the cell can accommodate over the area of the cell. The sectors with less than Td density exhibits transmit power which approaches to zero or sleeping state and so that the cumulative power is saved. Simulation results show that an average of 45% to 50% energy can be saved in 10 iterations.

Style APA, Harvard, Vancouver, ISO itp.

Silva, Cauane Blumenberg. "Adaptive tiling algorithm based on highly correlated picture regions for the HEVC standard". reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2014. http://hdl.handle.net/10183/96040.

Pełny tekst źródła

Streszczenie:

Esta dissertação de mestrado propõe um algoritmo adaptativo que é capaz de dinamicamente definir partições tile para quadros intra- e inter-preditos com o objetivo de reduzir o impacto na eficiência de codificação. Tiles são novas ferramentas orientadas ao paralelismo que integram o padrão de codificação de vídeos de alta eficiência (HEVC – High Efficiency Video Coding standard), as quais dividem o quadro em regiões retangulares independentes que podem ser processadas paralelamente. Para viabilizar o paralelismo, os tiles quebram as dependências de codificação através de suas bordas, gerando impactos na eficiência de codificação. Este impacto pode ser ainda maior caso os limites dos tiles dividam regiões altamente correlacionadas do quadro, porque a maior parte das ferramentas de codificação usam informações de contexto durante o processo de codificação. Assim, o algoritmo proposto agrupa as regiões do quadro que são altamente correlacionadas dentro de um mesmo tile para reduzir o impacto na eficiência de codificação que é inerente ao uso de tiles. Para localizar as regiões altamente correlacionadas do quadro de uma maneira inteligente, as características da imagem e também as informações de codificação são analisadas, gerando mapas de particionamento que servem como parâmetro de entrada para o algoritmo. Baseado nesses mapas, o algoritmo localiza as quebras naturais de contexto presentes nos quadros do vídeo e define os limites dos tiles nessas regiões. Dessa maneira, as quebras de dependência causadas pelas bordas dos tiles coincidem com as quebras de contexto naturais do quadro, minimizando as perdas na eficiência de codificação causadas pelo uso dos tiles. O algoritmo proposto é capaz de reduzir mais de 0.4% e mais de 0.5% o impacto na eficiência de codificação causado pelos tiles em quadros intra-preditos e inter-preditos, respectivamente, quando comparado com tiles uniformes.
This Master Thesis proposes an adaptive algorithm that is able to dynamically choose suitable tile partitions for intra- and inter-predicted frames in order to reduce the impact on coding efficiency arising from such partitioning. Tiles are novel parallelismoriented tools that integrate the High Efficiency Video Coding (HEVC) standard, which divide the frame into independent rectangular regions that can be processed in parallel. To enable the parallelism, tiles break the coding dependencies across their boundaries leading to coding efficiency impacts. These impacts can be even higher if tile boundaries split highly correlated picture regions, because most of the coding tools use context information during the encoding process. Hence, the proposed algorithm clusters the highly correlated picture regions inside the same tile to reduce the inherent coding efficiency impact of using tiles. To wisely locate the highly correlated picture regions, image characteristics and encoding information are analyzed, generating partitioning maps that serve as the algorithm input. Based on these maps, the algorithm locates the natural context break of the picture and defines the tile boundaries on these key regions. This way, the dependency breaks caused by the tile boundaries match the natural context breaks of a picture, then minimizing the coding efficiency losses caused by the use of tiles. The proposed adaptive tiling algorithm, in some cases, provides over 0.4% and over 0.5% of BD-rate savings for intra- and inter-predicted frames respectively, when compared to uniform-spaced tiles, an approach which does not consider the picture context to define the tile partitions.

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Książki na temat "Algorithm efficiency"

United States. National Aeronautics and Space Administration., red. Parallelization of the implicit RPLUS algorithm: Final report, NASA grant NAG 3-1472. [Washington, DC: National Aeronautics and Space Administration, 1994.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Alan, Gibbons. Efficient parallel algorithms. Cambridge [England]: Cambridge University Press, 1988.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Albers, Susanne, Helmut Alt i Stefan Näher, red. Efficient Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03456-5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Kronsjö, Lydia. Algorithms: Their complexity and efficiency. Wyd. 2. Chichester: Wiley, 1987.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Evripidis, Bampis, Jansen Klaus i Kenyon Claire, red. Efficient approximation and online algorithms: Recent progress on classical combinatorical optimization problems and new applications. New York: Springer, 2006.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Jansen, Klaus, Marian Margraf, Monaldo Mastrolilli i José D. P. Rolim, red. Experimental and Efficient Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44867-5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Nikoletseas, Sotiris E., red. Experimental and Efficient Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/b136461.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Ribeiro, Celso C., i Simone L. Martins, red. Experimental and Efficient Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/b97914.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Części książek na temat "Algorithm efficiency"

Sharma, Neetu, B. C. Sharma, Anil Kumar i Rakesh Kumar. "Nutrient Uptake and Nutrient Use Efficiency". W Agronomy Algorithm, 59–72. London: CRC Press, 2022. http://dx.doi.org/10.1201/9781003347286-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Zeke, Wang, Xu Senlin i Gao Tangan. "Efficiency of Kuhn’s Algorithm". W Algebraic Systems of Equations and Computational Complexity Theory, 31–56. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-011-0796-9_2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Wiener, Richard. "Algorithm Efficiency: Sorting and Searching". W Generic Data Structures and Algorithms in Go, 55–89. Berkeley, CA: Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-8191-8_2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Bansal, Jagdish Chand, Prathu Bajpai, Anjali Rawat i Atulya K. Nagar. "Conclusion and Further Research Directions". W Sine Cosine Algorithm for Optimization, 105–6. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-9722-8_6.

Pełny tekst źródła

Streszczenie:

AbstractThe increasing complexity of real-world optimization problems demands fast, robust, and efficient meta-heuristic algorithms. The popularity of these intelligent techniques is gaining popularity day by day among researchers from various disciplines of science and engineering. The sine cosine algorithm is a simple population-based stochastic approach for handling different optimization problems. In this work, we have discussed the basic sine cosine algorithm for continuous optimization problems, the multi-objective sine cosine algorithm for handling multi-objective optimization problems, and the discrete (or binary) versions of sine cosine algorithm for discrete optimization problems. Sine cosine algorithm (SCA) has reportedly shown competitive results when compared to other meta-heuristic algorithms. The easy implementation and less number of parameters make the SCA algorithm, a recommended choice for performing various optimization tasks. In this present chapter, we have studied different modifications and strategies for the advancement of the sine cosine algorithm. The incorporation of concepts like opposition-based learning, quantum simulation, and hybridization with other meta-heuristic algorithms have increased the efficiency and robustness of the SCA algorithm, and meanwhile, these techniques have also increased the application spectrum of the sine cosine algorithm.

Style APA, Harvard, Vancouver, ISO itp.

Beckert, Bernhard, Peter Sanders, Mattias Ulbrich, Julian Wiesler i Sascha Witt. "Formally Verifying an Efficient Sorter". W Tools and Algorithms for the Construction and Analysis of Systems, 268–87. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57246-3_15.

Pełny tekst źródła

Streszczenie:

AbstractIn this experience report, we present the complete formal verification of a Java implementation of inplace superscalar sample sort ( "Image missing") using the KeY program verification system. As "Image missing" is one of the fastest general purpose sorting algorithms, this is an important step towards a collection of basic toolbox components that are both provably correct and highly efficient. At the same time, it is an important case study of how careful, highly efficient implementations of complicated algorithms can be formally verified directly. We provide an analysis of which features of the KeY system and its verification calculus are instrumental in enabling algorithm verification without any compromise on algorithm efficiency.

Style APA, Harvard, Vancouver, ISO itp.

Aye, Tin Nwe, i Linus Carlsson. "Increasing Efficiency in the EBT Algorithm". W The Springer Series on Demographic Methods and Population Analysis, 289–317. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44695-6_19.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Rubinstein-Salzedo, Simon. "Big O Notation and Algorithm Efficiency". W Springer Undergraduate Mathematics Series, 75–83. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94818-8_8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Goldengorin, Boris, Diptesh Ghosh i Gerard Sierksma. "Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem". W Algorithm Engineering, 106–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44688-5_9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Liu, Dan, Xinsong Liu, Zhijie Qiu i Gongjun Yan. "A High Efficiency Distributed Mutual Exclusion Algorithm". W Lecture Notes in Computer Science, 75–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39425-9_8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Mussabayev, Rustam, i Ravil Mussabayev. "Superior Parallel Big Data Clustering Through Competitive Stochastic Sample Size Optimization in Big-Means". W Intelligent Information and Database Systems, 224–36. Singapore: Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-4985-0_18.

Pełny tekst źródła

Streszczenie:

AbstractThis paper introduces a novel K-means clustering algorithm, an advancement on the conventional Big-means methodology. The proposed method efficiently integrates parallel processing, stochastic sampling, and competitive optimization to create a scalable variant designed for big data applications. It addresses scalability and computation time challenges typically faced with traditional techniques. The algorithm adjusts sample sizes dynamically for each worker during execution, optimizing performance. Data from these sample sizes are continually analyzed, facilitating the identification of the most efficient configuration. By incorporating a competitive element among workers using different sample sizes, efficiency within the Big-means algorithm is further stimulated. In essence, the algorithm balances computational time and clustering quality by employing a stochastic, competitive sampling strategy in a parallel computing setting.

Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Algorithm efficiency"

Kessentini, Amina, Ibtissem Wali, Taheni Damak i Nouri Masmoudi. "Efficient Algorithm for Scalable High Efficiency Video Coding Intra Prediction process". W 2024 IEEE 7th International Conference on Advanced Technologies, Signal and Image Processing (ATSIP), 365–70. IEEE, 2024. http://dx.doi.org/10.1109/atsip62566.2024.10638865.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Bai, Sixue, i Xinxi Dai. "An Efficiency apriori Algorithm: P_Matrix Algorithm". W The First International Symposium on Data, Privacy, and E-Commerce (ISDPE 2007). IEEE, 2007. http://dx.doi.org/10.1109/isdpe.2007.136.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Yoshizumi, Toshihiro, Takaaki Goto, Yoshinao Isobe, Kazuhito Ohmaki, Hideki Mori i Kensei Tsuchida. "Parallel algorithm that considers energy efficiency and time efficiency". W 2016 IEEE International Conference on Industrial Technology (ICIT). IEEE, 2016. http://dx.doi.org/10.1109/icit.2016.7475023.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Kashirin, Igor Yu, i Nikolay S. Kurdyukov. "Efficiency proof of Sirread algorithm". W 2014 International Conference on Computer Technologies in Physical and Engineering Applications (ICCTPEA). IEEE, 2014. http://dx.doi.org/10.1109/icctpea.2014.6893284.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Intae Kang i R. Poovendran. "A novel power-efficient broadcast routing algorithm exploiting broadcast efficiency". W 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484). IEEE, 2003. http://dx.doi.org/10.1109/vetecf.2003.1286159.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Shi, Nandi, Ran Ma, Panpan Li, Ping An i Qian Zhang. "Efficient mode decision algorithm for scalable high efficiency video coding". W SPIE/COS Photonics Asia, redaktorzy Qionghai Dai i Tsutomu Shimura. SPIE, 2014. http://dx.doi.org/10.1117/12.2071709.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Kuznetsov, Evgeniy M., i Vyacheslav P. Klimanov. "Efficiency of an Algorithm of Scheduling". W 2018 International Multi-Conference on Industrial Engineering and Modern Technologies (FarEastCon). IEEE, 2018. http://dx.doi.org/10.1109/fareastcon.2018.8602568.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Eisenhammer, Thomas, Michel P. Lazarov i R. Sizmann. "Optimization of silver-based heat mirrors using a genetic algorithm". W Optical Materials Technology for Energy Efficiency and Solar Energy, redaktorzy Anne Hugot-Le Goff, Claes-Goeran Granqvist i Carl M. Lampert. SPIE, 1992. http://dx.doi.org/10.1117/12.130491.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Nawab, Akash, i Muhammad Mansoor Ashraf. "Distribution Feeder Reconfiguration Using Artificial Hummingbird Algorithm-Based Framework". W 2024 7th International Conference on Energy Conservation and Efficiency (ICECE). IEEE, 2024. http://dx.doi.org/10.1109/icece61222.2024.10505263.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Taheri, Ramin, i Karim Mazaheri. "Blade Shape Optimization of Marine Propeller via Genetic Algorithm for Efficiency Improvement". W ASME Turbo Expo 2012: Turbine Technical Conference and Exposition. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/gt2012-68183.

Pełny tekst źródła

Streszczenie:

In this paper, a numerical optimization method has been carried out to optimize the shape and efficiency of a propeller. For analysis of the hydrodynamic performance parameters, an extended vortex lattice method was used by implementing an open-source code which is called OpenProp. The method of optimization is a non-gradient based algorithm. After a trade-off between a few gradient-based and non-gradient based algorithms, it is found that the problem of being trapped in local optimum solutions can be easily solved by choosing nongradient based ones. Hence, modified Genetic algorithm is used to implement the so-called hydrodynamic performance analyzer code. The objective function is to maximize efficiency by considering the design variables as non-dimensional blade’s chord and thickness distribution along the blade. For initial guess data of the DTRC 4119 propeller which are radially distributed along the blade is used. The hydrodynamic performance analyzer code is modified by a higher order QuasiNewton scheme. Also hybrid function is used to accurate the convergence. Finally, parallel processing implementation on the codes has been done successfully. To improve the computation speed, the algorithm is improved to be extended on a parallel processing system. The process of parallelizing has been done simplicity by Matlab M-code and the number of cores has been chosen as 4. The final results verify both fast convergence in comparison with common methods and nearly 10% improvement in propeller efficiency (mechanical efficiency of the system) which is significant for these kinds of problems. Therefore, the algorithm starts with geometry arrived at by other researchers and improves it to a more efficient propeller.

Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Algorithm efficiency"

Goldberg, Andrew V., Michael D. Grigoriadis i Robert E. Tarjan. Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem. Fort Belvoir, VA: Defense Technical Information Center, październik 1988. http://dx.doi.org/10.21236/ada214691.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Rabitz, Herschel. A High Efficiency Algorithm for Combinatorial Synthesis: Maximum Utilization of Minimal Libraries. Fort Belvoir, VA: Defense Technical Information Center, styczeń 2003. http://dx.doi.org/10.21236/ada413449.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Willert, Jeffrey. Increased Efficiency and Functionality Inside the Moment-Based Accelerated Thermal Radiation Transport Algorithm. Office of Scientific and Technical Information (OSTI), wrzesień 2014. http://dx.doi.org/10.2172/1154961.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Tarjan, Robert E. Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem. Fort Belvoir, VA: Defense Technical Information Center, sierpień 1988. http://dx.doi.org/10.21236/ada215109.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Moseman, Elizabeth. Improving the Computational Efficiency of the Blitzstein-Diaconis Algorithm for Generating Random Graphs of Prescribed Degree. National Institute of Standards and Technology, lipiec 2015. http://dx.doi.org/10.6028/nist.ir.8066.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Li, Yan, Yuhao Luo i Xin Lu. PHEV Energy Management Optimization Based on Multi-Island Genetic Algorithm. SAE International, marzec 2022. http://dx.doi.org/10.4271/2022-01-0739.

Pełny tekst źródła

Streszczenie:

The plug-in hybrid electric vehicle (PHEV) gradually moves into the mainstream market with its excellent power and energy consumption control, and has become the research target of many researchers. The energy management strategy of plug-in hybrid vehicles is more complicated than conventional gasoline vehicles. Therefore, there are still many problems to be solved in terms of power source distribution and energy saving and emission reduction. This research proposes a new solution and realizes it through simulation optimization, which improves the energy consumption and emission problems of PHEV to a certain extent. First, on the basis that MATLAB software has completed the modeling of the key components of the vehicle, the fuzzy controller of the vehicle is established considering the principle of the joint control of the engine and the electric motor. Afterwards, based on the Isight and ADVISOR co-simulation platform, with the goal of ensuring certain dynamic performance and optimal fuel economy of the vehicle, the multi-island genetic algorithm is used to optimize the parameters of the membership function of the fuzzy control strategy to overcome it to a certain extent. The disadvantages of selecting parameters based on experience are compensated for, and the efficiency and feasibility of fuzzy control are improved. Finally, the PHEV vehicle model simulation comparison was carried out under the UDDS working condition through ADVISOR software. The optimization results show that while ensuring the required power performance, the vehicle fuzzy controller after parameter optimization using the multi-island genetic algorithm is more efficient, which can significantly reduce vehicle fuel consumption and improve exhaust emissions.

Style APA, Harvard, Vancouver, ISO itp.

Reddy, P. B., i T. M. Jahns. FINAL REPORT ON CONTROL ALGORITHM TO IMPROVE THE PARTIAL-LOAD EFFICIENCY OFSURFACE PM MACHINES WITH FRACTIONAL-SLOT CONCENTRATED WINDINGS. Office of Scientific and Technical Information (OSTI), kwiecień 2007. http://dx.doi.org/10.2172/921785.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

McKeever, John W., Patel Reddy i Thomas M. Jahns. Final Report on Control Algorithm to Improve the Partial-Load Efficiency of Surface PM Machines with Fractional-Slot Concentrated Windings. Office of Scientific and Technical Information (OSTI), maj 2007. http://dx.doi.org/10.2172/931549.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Martinez-Carrasco, José, Otavio Conceição i Ana Lúcia Dezolt. More Information, Lower Price? Access Market-based Reference Prices and Gains in Public Procurement Efficiency. Inter-American Development Bank, marzec 2023. http://dx.doi.org/10.18235/0004794.

Pełny tekst źródła

Streszczenie:

The paper examines the impact of providing market-based reference prices on public procurement efficiency in Brazil. Specifically, the study focuses on the State Secretariat of Health (SES) in Rio Grande do Sul and the algorithm developed by the local tax administration to calculate representative reference prices for pharmaceutical products. Unlike previous studies, reference prices are calculated based on the universe of local business-to-business transactions. The study finds that SES procurement officers access to this information caused a significant reduction in purchase unit prices, particularly for products characterized by a higher ex-ante unit price, a smaller number of suppliers, and purchased by a smaller number of public institutions. The gains in efficiency are attributed to the use of up-to-date market information, which is particularly useful for products where information asymmetry is more likely to exist between procurement officers and private providers.

Style APA, Harvard, Vancouver, ISO itp.

Elacqua, Gregory, Anne Sofie Westh Olsen i Santiago Velez-Ferro. Open configuration options The Market Design Approach to Teacher Assignment: Evidence from Ecuador. Inter-American Development Bank, wrzesień 2021. http://dx.doi.org/10.18235/0003824.

Pełny tekst źródła

Streszczenie:

We study the advantages, trade-offs, and challenges of employing a centralized rule to determine the allocation of teachers to schools. Data come from the centralized teacher assignment program in Ecuador, "Quiero ser Maestro," conducted by the Ministry of Education. Notably, in 2019 the program transitioned from a priority based algorithm to a strategy proof mechanism, similar to the change introduced in Boston in 2005 to assign students to schools. Using the reported preferences, we conduct a counterfactual analysis and nd substantive evidence that the adjustment in algorithm resulted in greater efficiency for the school system. However, in contrast to the Boston case, we nd the benefits stem from increasing the competition for positions among teachers, rather than by the introduction of a strategy-proof mechanism.

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!