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

Data aktualizacji: 19 lipca 2025

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, and Petro Shylo. "The Efficiency of Discrete Optimization Algorithm Portfolios." Cybernetics and Computer Technologies, no. 2 (June 30, 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

Style APA, Harvard, Vancouver, ISO itp.

Zarembo, Imants, and Sergejs Kodors. "Pathfinding Algorithm Efficiency Analysis in 2D Grid." Environment. Technology. Resources. Proceedings of the International Scientific and Practical Conference 2 (August 8, 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 conducti

Style APA, Harvard, Vancouver, ISO itp.

Zhi, Xiangyu, Xiao Yan, Bo Tang, Ziyao Yin, Yanchao Zhu, and Minqi Zhou. "CoroGraph: Bridging Cache Efficiency and Work Efficiency for Graph Algorithm Execution." Proceedings of the VLDB Endowment 17, no. 4 (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 a

Style APA, Harvard, Vancouver, ISO itp.

Brandejsky, Tomas. "Function Set Structure Influence onto GPA Efficiency." MENDEL 23, no. 1 (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.

Amannah, Constance Izuchukwu, and Francis Sunday Bakpo. "SIMPLIFIED BLUESTEIN NUMERICAL FAST FOURIER TRANSFORMS ALGORITHM FOR DSP AND ASP." International Journal of Research – Granthaalayah 3, no. 11 (2017): 153–63. https://doi.org/10.5281/zenodo.849031.

Pełny tekst źródła

Streszczenie:

This research was designed to develop a simplified Bluestein numerical FFT algorithm necessary for the processing of digital signals. The simplified numerical algorithm developed in this study is abbreviated with SBNADSP. The methodology adopted in this work was iterative and incremental development design. The major technology used in this work is the Bluestein numerical FFT algorithm. The study set the pace for its goal by re-indexing, decomposing, and simplifying the default Fast Fourier Transform Algorithms (the Bluestein FFT Algorithm). The improved efficiency of the Bluestein FFT algorit

Style APA, Harvard, Vancouver, ISO itp.

Xiao, Shi Song, Ao Lin Wang, and Hui Feng. "An Improved Algorithm Based on AC-BM Algorithm." Applied Mechanics and Materials 380-384 (August 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.

Klyatchenko, Yaroslav, and Volodymyr Holub. "EFFICIENCY OF LOSSLESS DATA COMPRESSION ALGORITHM MODIFICATION." Bulletin of National Technical University "KhPI". Series: System Analysis, Control and Information Technologies, no. 2 (10) (December 19, 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

Style APA, Harvard, Vancouver, ISO itp.

Mrs., Pooja V. "Enhancing Scheduling Efficiency in Graph Theory: A Novel Approach to Maximum Matching." Journal of Scholastic Engineering Science and Management 3, no. 3 (2024): 1–13. https://doi.org/10.5281/zenodo.10907243.

Pełny tekst źródła

Streszczenie:

The maximum matching problem is a fundamental problem in graph theory. It asks for the maximum number of edges that can be selected in a graph so that no two selected edges share an endpoint. This problem has applications in many areas, such as scheduling, transportation, and telecommunications. Existing algorithms for finding the maximum matching in a graph are often inefficient. For example, the brute-force algorithm can take exponential time to find the maximum matching in a graph. In this paper, we present a new algorithm for finding the maximum matching in a graph. Our algorithm is based

Style APA, Harvard, Vancouver, ISO itp.

Wang, Chun Ye, and Xiao Feng Zhou. "The MapReduce Parallel Study of KNN Algorithm." Advanced Materials Research 989-994 (July 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.

Zaharov, D. O., and A. P. Karpenko. "Study of League Championship Algorithm Efficiency for Global Optimization Problem." Mathematics and Mathematical Modeling, no. 2 (June 9, 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 exha

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 genera

Style APA, Harvard, Vancouver, ISO itp.

Batbayar, Batsukh, and 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 seve

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 appro

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, and 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 puz

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

Style APA, Harvard, Vancouver, ISO itp.

Kassa, Hailu Belay, Shenko Chura Aredo, and 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 o

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 i

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Książki na temat "Algorithm efficiency"

United States. National Aeronautics and Space Administration., ed. Parallelization of the implicit RPLUS algorithm: Final report, NASA grant NAG 3-1472. 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 University Press, 1988.

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

Style APA, Harvard, Vancouver, ISO itp.

Albers, Susanne, Helmut Alt, and Stefan Näher, eds. Efficient Algorithms. 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. 2nd ed. Wiley, 1987.

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

Style APA, Harvard, Vancouver, ISO itp.

Evripidis, Bampis, Jansen Klaus, and Kenyon Claire, eds. Efficient approximation and online algorithms: Recent progress on classical combinatorical optimization problems and new applications. 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, and José D. P. Rolim, eds. Experimental and Efficient Algorithms. 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., ed. Experimental and Efficient Algorithms. 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., and Simone L. Martins, eds. Experimental and Efficient Algorithms. 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, and Rakesh Kumar. "Nutrient Uptake and Nutrient Use Efficiency." In Agronomy Algorithm. 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, and Gao Tangan. "Efficiency of Kuhn’s Algorithm." In Algebraic Systems of Equations and Computational Complexity Theory. 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." In Generic Data Structures and Algorithms in Go. 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, and Atulya K. Nagar. "Conclusion and Further Research Directions." In Sine Cosine Algorithm for Optimization. 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.

Aye, Tin Nwe, and Linus Carlsson. "Increasing Efficiency in the EBT Algorithm." In The Springer Series on Demographic Methods and Population Analysis. 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." In Springer Undergraduate Mathematics Series. 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, and Gerard Sierksma. "Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem." In Algorithm Engineering. 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.

Beckert, Bernhard, Peter Sanders, Mattias Ulbrich, Julian Wiesler, and Sascha Witt. "Formally Verifying an Efficient Sorter." In Tools and Algorithms for the Construction and Analysis of Systems. 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.

Liu, Dan, Xinsong Liu, Zhijie Qiu, and Gongjun Yan. "A High Efficiency Distributed Mutual Exclusion Algorithm." In Lecture Notes in Computer Science. 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, and Ravil Mussabayev. "Superior Parallel Big Data Clustering Through Competitive Stochastic Sample Size Optimization in Big-Means." In Intelligent Information and Database Systems. 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"

Demidova, Liliya A., and Nikita A. Moroshkin. "An Algorithm for Optimizing the Performance of Regular Expressions Using Population Algorithms." In 2024 6th International Conference on Control Systems, Mathematical Modeling, Automation and Energy Efficiency (SUMMA). IEEE, 2024. https://doi.org/10.1109/summa64428.2024.10803824.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Gul, Noman, Asad Masood Khattak, Muhammad Imran Taj, Nagarajan Chandrashekaran, Bashir Hayat, and Awais Ahmad. "Enhancing parking efficiency: An innovative vehicle scheduling algorithm." In 2024 IEEE International Conference on Information Reuse and Integration for Data Science (IRI). IEEE, 2024. http://dx.doi.org/10.1109/iri62200.2024.00027.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

pan, meiyan, wei xu, xingyu cai, wanbing hao, and jian xue. "Cooperative jamming allocation algorithm based on interference efficiency." In Sixteenth International Conference on Signal Processing Systems (ICSPS 2024), edited by Robert Minasian and Li Chai. SPIE, 2025. https://doi.org/10.1117/12.3060333.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Huang, Jinfei, Wenbin Chen, Hao Guo, Huachao Lv, qiqi zhang, and Jian Zhou. "Application research of water efficiency test equipment for toilet flushing valve." In 4th International Conference on Automation Control. Algorithm and Intelligent Bionics, edited by Jing Na and Shuping He. SPIE, 2024. http://dx.doi.org/10.1117/12.3040310.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Huang, Jinfei, Wenbin Chen, Hao Guo, et al. "Research on the structure of intelligent toilet water efficiency testing machine." In 4th International Conference on Automation Control. Algorithm and Intelligent Bionics, edited by Jing Na and Shuping He. SPIE, 2024. http://dx.doi.org/10.1117/12.3040318.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Zhang, Chaoshun, and Hua Liu. "Dynamic Air Conditioning Efficiency Model Based on Genetic Algorithm and Particle Swarm Algorithm." In 2025 IEEE International Conference on Electronics, Energy Systems and Power Engineering (EESPE). IEEE, 2025. https://doi.org/10.1109/eespe63401.2025.10987569.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Shriya, P. V., and W. Deva Priya. "An Efficient Innovative Masked Face Recognition Using FaceNet Algorithm over Visual Geometry Group (VGG-16) Algorithm for Better Efficiency." In 2024 15th International Conference on Computing Communication and Networking Technologies (ICCCNT). IEEE, 2024. http://dx.doi.org/10.1109/icccnt61001.2024.10725817.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Bai, Sixue, and Xinxi Dai. "An Efficiency apriori Algorithm: P_Matrix Algorithm." In 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, and Kensei Tsuchida. "Parallel algorithm that considers energy efficiency and time efficiency." In 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.

Raporty organizacyjne na temat "Algorithm efficiency"

Goldberg, Andrew V., Michael D. Grigoriadis, and Robert E. Tarjan. Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem. Defense Technical Information Center, 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. Defense Technical Information Center, 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), 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. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada215109.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Radvand, Tina, and Alireza Talebpour. A Quantum Optimization Algorithm for Optimal Electric Vehicle Charging Station Placement for Intercity Trips. Illinois Center for Transportation, 2024. https://doi.org/10.36501/0197-9191/24-028.

Pełny tekst źródła

Streszczenie:

Electric vehicles (EVs) play a significant role in enhancing the sustainability of transportation systems. However, their widespread adoption is hindered by inadequate public charging infrastructure, particularly to support long-distance travel. Identifying optimal charging station locations in large transportation networks presents a well-known NP-hard combinatorial optimization problem, as the search space grows exponentially with the number of potential charging station locations. This report introduces a quantum search-based optimization algorithm designed to enhance the efficiency of solv

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, 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, and Xin Lu. PHEV Energy Management Optimization Based on Multi-Island Genetic Algorithm. SAE International, 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 PH

Style APA, Harvard, Vancouver, ISO itp.

Reddy, P. B., and 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), 2007. http://dx.doi.org/10.2172/921785.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Tayeb, Shahab. Intelligent Blind Crossings for Suburban and Rural Intersections. Mineta Transportation Institute, 2025. https://doi.org/10.31979/mti.2024.2351.

Pełny tekst źródła

Streszczenie:

Blind intersections in suburban and rural areas pose significant safety challenges due to limited visibility and inadequate infrastructure. This project proposes an innovative solution leveraging the Internet of Vehicles (IoV) paradigm, utilizing connected and autonomous vehicles (CAVs) for seamless communication to enhance safety at these intersections. The research focuses on developing a specialized Road-Side Unit (RSU) system equipped with a Virtual Traffic Light Algorithm implemented on a Field-Programmable Gate Array (FPGA). Key stakeholders, including transportation authorities, vehicle

Style APA, Harvard, Vancouver, ISO itp.

McKeever, John W., Patel Reddy, and 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), 2007. http://dx.doi.org/10.2172/931549.

Pełny tekst źródła

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!