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

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

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

Автор: Grafiati

Опубліковано: 3 червня 2025

Оновлено: 31 липня 2025

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

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

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

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

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

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

Xue, Xiaomei, Zhengquan Li, Yongqiang Man, et al. "Improved Massive MIMO RZF Precoding Algorithm Based on Truncated Kapteyn Series Expansion." Information 10, no. 4 (2019): 136. http://dx.doi.org/10.3390/info10040136.

Повний текст джерела

Анотація:

In order to reduce the computational complexity of the inverse matrix in the regularized zero-forcing (RZF) precoding algorithm, this paper expands and approximates the inverse matrix based on the truncated Kapteyn series expansion and the corresponding low-complexity RZF precoding algorithm is obtained. In addition, the expansion coefficients of the truncated Kapteyn series in our proposed algorithm are optimized, leading to further improvement of the convergence speed of the precoding algorithm under the premise of the same computational complexity as the traditional RZF precoding. Moreover,

Стилі APA, Harvard, Vancouver, ISO та ін.

Ren, Jin, Jingxing Chen, and Liang Feng. "A Novel Positioning Algorithm Based on Self-adaptive Algorithm of RBF Network." Open Electrical & Electronic Engineering Journal 10, no. 1 (2016): 141–48. http://dx.doi.org/10.2174/1874129001610010141.

Повний текст джерела

Анотація:

Much attention has been paid to Taylor series expansion (TSE) method these years, which has been extensively used for solving nonlinear equations for its good robustness and accuracy of positioning. A Taylor-series expansion location algorithm based on the RBF neural network (RBF-TSE) is proposed before to the performance of TSE highly depends on the initial estimation. In order to have more accurate and lower cost,a new Taylor-series expansion location algorithm based on Self-adaptive RBF neural network (SA-RBF-TSE) is proposed to estimate the initial value. The proposed algorithm is analysed

Стилі APA, Harvard, Vancouver, ISO та ін.

Wang, Pengjun, Zhenhai Wang, Rui Xu, Zhidi Jiang, and Disheng Wang. "Conversion algorithm for MPRM expansion." Journal of Semiconductors 35, no. 3 (2014): 035007. http://dx.doi.org/10.1088/1674-4926/35/3/035007.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wise, Christi L., and Justin A. Zakis. "Effects of Expansion Algorithms on Speech Reception Thresholds." Journal of the American Academy of Audiology 19, no. 02 (2008): 147–57. http://dx.doi.org/10.3766/jaaa.19.2.5.

Повний текст джерела

Анотація:

Expansion is commonly used to reduce microphone noise and low-level environmental noises that can be annoying to hearing aid users. It may also improve or reduce the perception of low-level speech. This study assessed the impact of two expansion algorithms, single and multiple channel, on speech reception thresholds (SRT) with 10 hearing impaired listeners wearing hearing aids with ADRO® processing. The single-channel algorithm suppressed sounds below 45 dB A, while the multiple-channel algorithm suppressed sounds below the long-term average spectrum of speech at either 55 or 45 dB SPL. The me

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhao, Yuxue, Hongxin Zhang, Yuanzhen Wang, Chenxu Li, Ruilin Xu, and Chen Yang. "An extended binary subband canonical correlation analysis detection algorithm oriented to the radial contraction-expansion motion steady-state visual evoked paradigm." Brain Science Advances 8, no. 1 (2022): 19–37. http://dx.doi.org/10.26599/bsa.2022.9050004.

Повний текст джерела

Анотація:

The radial contraction-expansion motion paradigm is a novel steady-state visual evoked experimental paradigm, and the electroencephalography (EEG) evoked potential is different from the traditional luminance modulation paradigm. The signal energy is concentrated chiefly in the fundamental frequency, while the higher harmonic power is lower. Therefore, the conventional steady-state visual evoked potential recognition algorithms optimizing multiple harmonic response components, such as the extended canonical correlation analysis (eCCA) and task-related component analysis (TRCA) algorithm, have p

Стилі APA, Harvard, Vancouver, ISO та ін.

Arrag, Sliman, Abdellatif Hamdoun, Abderrahim Tragha, and Salah eddine Khamlich. "Replace AES key expansion algorithm by modified genetic algorithm." Applied Mathematical Sciences 7 (2013): 7161–71. http://dx.doi.org/10.12988/ams.2013.38482.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhang, Zhengwei, Mingjian Zhang, and Liuyang Wang. "Reversible Image Watermarking Algorithm Based on Quadratic Difference Expansion." Mathematical Problems in Engineering 2020 (January 9, 2020): 1–8. http://dx.doi.org/10.1155/2020/1806024.

Повний текст джерела

Анотація:

To improve the visual quality and embedding rate of existing reversible image watermarking algorithms, a reversible image watermarking algorithm based on quadratic difference expansion is proposed. First, the pixel points with grayscale values 0 and 255 in the original image are removed, and then, the half-scrambled watermark information is embedded into the original image using linear difference expansion. Finally, the remaining half of the watermark information is embedded into the previously generated watermarked image by the quadratic difference expansion, meanwhile the removed pixel point

Стилі APA, Harvard, Vancouver, ISO та ін.

Eckerle, Juergen, Jingwei Chen, Nathan Sturtevant, Sandra Zilles, and Robert Holte. "Sufficient Conditions for Node Expansion in Bidirectional Heuristic Search." Proceedings of the International Conference on Automated Planning and Scheduling 27 (June 5, 2017): 79–87. http://dx.doi.org/10.1609/icaps.v27i1.13825.

Повний текст джерела

Анотація:

In this paper we study bidirectional state space search with consistent heuristics, with a focus on obtaining sufficient conditions for node expansion, that is, conditions characterizing nodes that must be expanded by any admissible bidirectional search algorithm. We provide such conditions for front-to-front and front-to-end bidirectional search. The sufficient conditions are used to prove that the front-to-front bidirectional search algorithm BDS1 is optimally efficient, in terms of node expansion, among a broad class of bidirectional search algorithms, for a specific class of problem instan

Стилі APA, Harvard, Vancouver, ISO та ін.

LIM, K. M., E. T. ONG, H. P. LEE, and S. P. LIM. "A FAST BOUNDARY ELEMENT METHOD FOR UNDERWATER ACOUSTICS." Modern Physics Letters B 19, no. 28n29 (2005): 1679–82. http://dx.doi.org/10.1142/s0217984905010207.

Повний текст джерела

Анотація:

A fast algorithm for the boundary element method is developed to handle problems in underwater acoustics. The algorithm employs the multipole and local expansions to approximate far-field potentials, and exploits the discrete convolution nature of mapping multipole to local expansions to accelerate the potential evaluation process. The speedup in the solution process is achieved by fast Fourier transform on the multipole and local expansion coefficients on a regular grid. The method is demonstrated by a three-dimensional underwater acoustics scattering problem, and it is found to achieve accur

Стилі APA, Harvard, Vancouver, ISO та ін.

Dr Bhadresh R. Pandya, Bhumika S. Arora, Dr Vijay Chavda,. "PxEBCA: Proximity Expansion Based Clustering Algorithm." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 5 (2021): 852–56. http://dx.doi.org/10.17762/turcomat.v12i5.1494.

Повний текст джерела

Анотація:

Cluster analysis is one of the main techniques for analysing data. It is a technique for detecting groups of objects which are similar without specifying any criteria for the grouping. The matter of detecting clusters is challenging when the clusters are of varied size, density and shape. DBSCAN can find arbitrary shaped clusters along with outliers but it cannot handle different density. This paper presents a new method for detecting density based clusters which works on datasets having varied density. In this paper we propose PxEBCA that discovers clusters with arbitrary shape and also with

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Expansion Algorithm"

Willis, Timothy Alan. "A flexible expansion algorithm for user-chosen abbreviations." Thesis, University of Edinburgh, 2008. http://hdl.handle.net/1842/3477.

Повний текст джерела

Анотація:

People with some types of motor disabilities who wish to generate text using a computer can find the process both fatiguing and time-consuming. These problems can be alleviated by reducing the quantity of keystrokes they must make, and one approach is to allow the user to enter shortened, abbreviated input, which is then re-expanded for them, by a program ‘filling in the gaps’. Word Prediction is one approach, but comes with drawbacks, one of which is the requirement that generally the user must type the first letters of their intended word, regardless of how unrepresentative they may consider

Стилі APA, Harvard, Vancouver, ISO та ін.

ASSIS, FERNANDO APARECIDO DE. "CONSTRUCTIVE METAHEURISTIC ALGORITHM FOR SOLVING TRANSMISSION EXPANSION PLANNING PROBLEMS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35771@1.

Повний текст джерела

Анотація:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO PROGRAMA DE EXCELENCIA ACADEMICA O planejamento da expansão da transmissão (PET) visa identificar reforços para a rede a fim de permitir uma adequada interligação entre a demanda e a geração de energia elétrica, ambas previstas para um determinado horizonte futuro de planejamento. Um bom plano de expansão deve garantir o adequado equilíbrio entre o custo de investimento e o custo de operação, mantendo ainda um

Стилі APA, Harvard, Vancouver, ISO та ін.

Sum-Im, Thanathip. "A novel differential evolution algorithmic approach to transmission expansion planning." Thesis, Brunel University, 2009. http://bura.brunel.ac.uk/handle/2438/3219.

Повний текст джерела

Анотація:

Nowadays modern electric power systems consist of large-scale and highly complex interconnected transmission systems, thus transmission expansion planning (TEP) is now a significant power system optimisation problem. The TEP problem is a large-scale, complex and nonlinear combinatorial problem of mixed integer nature where the number of candidate solutions to be evaluated increases exponentially with system size. The accurate solution of the TEP problem is essential in order to plan power systems in both an economic and efficient manner. Therefore, applied optimisation methods should be suffic

Стилі APA, Harvard, Vancouver, ISO та ін.

Alnahwi, F. M., Y. I. A. Al-Yasir, D. Sattar, R. S. Ali, C. H. See, and Raed A. Abd-Alhameed. "A New Optimization Algorithm Based on the Fungi Kingdom Expansion Behavior for Antenna Applications." MDPI, 2021. http://hdl.handle.net/10454/18595.

Повний текст джерела

Анотація:

Yes This paper presents a new optimization algorithm based on the behavior of the fungi kingdom expansion (FKE) to optimize the radiation pattern of the array antenna. The immobile mass ex-pansion of the fungi is mimicked in this work as a chaotic behavior with a sinusoidal map func-tion, while the mobile mass expansion is realized by a linear function. In addition, the random germination of the spores is utilized for randomly distributing the variables that are far away from the best solution. The proposed FKE algorithm is applied to optimize the radiation pattern of the antenna array, and

Стилі APA, Harvard, Vancouver, ISO та ін.

Rivas-Davalos, Francisco. "A genetic algorithm for power distribution system planning." Thesis, Brunel University, 2004. http://bura.brunel.ac.uk/handle/2438/7891.

Повний текст джерела

Анотація:

The planning of distribution systems consists in determining the optimum site and size of new substations and feeders in order to satisfy the future power demand with minimum investment and operational costs and an acceptable level of reliability. This problem is a combinatorial, non-linear and constrained optimization problem. Several solution methods based on genetic algorithms have been reported in the literature; however, some of these methods have been reported with applications to small systems while others have long solution time. In addition, the vast majority of the developed methods

Стилі APA, Harvard, Vancouver, ISO та ін.

Georgikopoulos, Nikolaos. "An expectation maximisation algorithm and the generalized Edgeworth series expansion applied to value-at-risk." Thesis, Imperial College London, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.417040.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Neves, Patrícia Silva. "Expansão estática de sistemas de transmissão de energia elétrica via FPA." Universidade Federal de Juiz de Fora (UFJF), 2017. https://repositorio.ufjf.br/jspui/handle/ufjf/6042.

Повний текст джерела

Анотація:

Submitted by Geandra Rodrigues (geandrar@gmail.com) on 2017-12-22T14:54:33Z No. of bitstreams: 1 patriciasilvaneves.pdf: 1941458 bytes, checksum: 16ab3b743d0b75134d320f08de292905 (MD5) Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2018-01-22T18:33:39Z (GMT) No. of bitstreams: 1 patriciasilvaneves.pdf: 1941458 bytes, checksum: 16ab3b743d0b75134d320f08de292905 (MD5) Made available in DSpace on 2018-01-22T18:33:39Z (GMT). No. of bitstreams: 1 patriciasilvaneves.pdf: 1941458 bytes, checksum: 16ab3b743d0b75134d320f08de292905 (MD5) Previous issue date:

Стилі APA, Harvard, Vancouver, ISO та ін.

Ikuma, Takeshi. "Non-Wiener Effects in Narrowband Interference Mitigation Using Adaptive Transversal Equalizers." Diss., Virginia Tech, 2007. http://hdl.handle.net/10919/26772.

Повний текст джерела

Анотація:

The least mean square (LMS) algorithm is widely expected to operate near the corresponding Wiener filter solution. An exception to this popular perception occurs when the algorithm is used to adapt a transversal equalizer in the presence of additive narrowband interference. The steady-state LMS equalizer behavior does not correspond to that of the fixed Wiener equalizer: the mean of its weights is different from the Wiener weights, and its mean squared error (MSE) performance may be significantly better than the Wiener performance. The contributions of this study serve to better understand thi

Стилі APA, Harvard, Vancouver, ISO та ін.

Levin, Todd. "Understanding the centralized-decentralized electrification paradigm." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/52165.

Повний текст джерела

Анотація:

Two methodologies are presented for analyzing the choice between centralized and decentralized energy infrastructures from a least-cost perspective. The first of these develops a novel minimum spanning tree network algorithm to approximate the shortest-length network that connects a given fraction of total system population. This algorithm is used to identify high priority locations for decentralized electrification in 150 countries. The second methodology utilizes a mixed-integer programming framework to determine the least-cost combination of centralized and decentralized electricity infr

Стилі APA, Harvard, Vancouver, ISO та ін.

Sousa, Aldir Silva. "Tomada de decisão Fuzzy e busca Tabu aplicadas ao planejamento da expansão de sistemas de transmissão." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/18/18154/tde-27052009-142518/.

Повний текст джерела

Анотація:

Neste trabalho é proposta uma nova técnica de solução para resolver o problema de planejamento da expansão de sistemas de transmissão estático através da introdução da tomada de decisão fuzzy. Na técnica apresentada neste trabalho, a tomada de decisão fuzzy é aplicada para o desenvolvimento de um algoritmo heurístico construtivo. O sistema fuzzy é utilizado para contornar alguns problemas críticos das heurísticas que utilizam o índice de sensibilidade como guia para inserção de novas linhas. A heurística apresentada nesse trabalho é baseada na técnica dividir para conquistar. Verificou-se que

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Expansion Algorithm"

McTavish, David. Expansion of Tiling Algorithm to include non-binary classification. The author], 1999.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kl͡iuchnikov, A. V. Realiza͡tsi͡ia konechnykh naborov prostykh ėksperimentov avtomatami. V͡TS AN SSSR, 1991.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

C, Mason J., and Cox M. G, eds. Algorithms for approximation II: Based on the proceedings of the Second International Conference on Algorithms for Approximation, held at Royal Military College of Science, Shrivenham, July 1988. Chapman and Hall, 1990.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Armin, Iske, Levesley Jeremy 1964-, and SpringerLink (Online service), eds. Approximation Algorithms for Complex Systems: Proceedings of the 6th International Conference on Algorithms for Approximation, Ambleside, UK, 31st August - 4th September 2009. Springer-Verlag Berlin Heidelberg, 2011.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Lee, Jon, and Sven Leyffer. Mixed integer nonlinear programming. Springer, 2012.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ervedoza, Sylvain. Numerical Approximation of Exact Controls for Waves. Springer New York, 2013.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Spencer, Joel H. Asymptopia. American Mathematical Society, 2014.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kahng, Hyunkon. A heuristic algorithm for a multi-stage plant expansion problem. 1992.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Tenney, James. On “Crystal Growth” in Harmonic Space. Edited by Larry Polansky, Lauren Pratt, Robert Wannamaker, and Michael Winter. University of Illinois Press, 2017. http://dx.doi.org/10.5406/illinois/9780252038723.003.0018.

Повний текст джерела

Анотація:

James Tenney talks about his “crystal growth” algorithm, an idea that suggests a new “harmonic syntax” for harmonic space. As a quantitative model, it is both suggestively rich for future composition and plausible as a description of the history of tonal expansion. In this algorithm, sets of points are chosen, one by one, in some n-dimensional harmonic space, under the condition that each new point must have the smallest possible sum of harmonic distances to all points already in the set. That is, at each successive stage in the growth of the harmonic lattice, the next ratio added to the set i

Стилі APA, Harvard, Vancouver, ISO та ін.

Shneiderman, Ben. Human-Centered AI. Oxford University Press, 2022. http://dx.doi.org/10.1093/oso/9780192845290.001.0001.

Повний текст джерела

Анотація:

Researchers, developers, business leaders, policy makers, and others are expanding the technology-centered scope of artificial intelligence (AI) to include human-centered AI (HCAI) ways of thinking. This expansion from an algorithm-focused view to embrace a human-centered perspective can shape the future of technology so as to better serve human needs. Educators, designers, software engineers, product managers, evaluators, and government agency staffers can build on AI-driven technologies to design products and services that make life better for people and enable people to care for each other.

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Expansion Algorithm"

Veksler, Olga. "Dynamic Programming for Approximate Expansion Algorithm." In Computer Vision – ECCV 2012. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33712-3_61.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Das, P., P. S. Bera, and P. Biswaas. "Bat-Algorithm-Based Transmission Expansion Planning." In Computational Advancement in Communication Circuits and Systems. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-8687-9_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wang, Chuanfu, and Qun Ding. "Camellia Key Expansion Algorithm Based on Chaos." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-48499-0_26.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Yajima, Takayuki, Tsuyoshi Hashimoto, Toshiki Matsui, Junichi Hashimoto, and Kristian Spoerer. "Node-Expansion Operators for the UCT Algorithm." In Computers and Games. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17928-0_11.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Liu, Yuhua, Shengsheng Yu, Jingzhong Mao, and Peng Yang. "Optimal Capacity Expansion Arc Algorithm on Networks." In Computational and Information Science. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30497-5_17.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhang, Dong-Xiao, Guo-Rong Cai, Zong-Qi Liang, and Huan Huang. "Image Super Resolution Using Expansion Move Algorithm." In Quantitative Logic and Soft Computing 2016. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46206-6_59.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Duong, Thanh Long, and Nguyen Duc Huy Bui. "Transmission Expansion Planning Using Zebra Optimization Algorithm." In Proceedings of the International Conference on Sustainable Energy Technologies. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-1868-9_77.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Vasiliy, Sachnev, Hyoung-Joong Kim, Shijun Xiang, and Jeho Nam. "An Improved Reversible Difference Expansion Watermarking Algorithm." In Digital Watermarking. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92238-4_20.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gao, HaoYang, and De Li. "Database Watermarking Algorithm Based on Difference Expansion." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-34387-3_90.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Piasecki, Maciej, Roman Kurc, Radosław Ramocki, and Bartosz Broda. "Lexical Activation Area Attachment Algorithm for Wordnet Expansion." In Artificial Intelligence: Methodology, Systems, and Applications. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33185-5_3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

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

Huang, Jijie, and Yang Chen. "Parallel Neighborhood Expansion Based Graph Edge Partitioning Algorithm." In 2024 IEEE 6th International Conference on Power, Intelligent Computing and Systems (ICPICS). IEEE, 2024. https://doi.org/10.1109/icpics62053.2024.10796853.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Srivastava, Rupesh, Tarun Tiwari, and Sweetesh Singh. "Bidirectional Expansion - Insertion Algorithm for Sorting." In 2009 Second International Conference on Emerging Trends in Engineering & Technology. IEEE, 2009. http://dx.doi.org/10.1109/icetet.2009.48.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Yan, Junjie, and Feng Chen. "An Improved AES Key Expansion Algorithm." In 2016 International Conference on Electrical, Mechanical and Industrial Engineering. Atlantis Press, 2016. http://dx.doi.org/10.2991/icemie-16.2016.28.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Robertson, Glen, and Xiaoying Gao. "Improving AbraQ: An Automatic Query Expansion Algorithm." In 2010 IEEE/ACM International Conference on Web Intelligence-Intelligent Agent Technology (WI-IAT). IEEE, 2010. http://dx.doi.org/10.1109/wi-iat.2010.95.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kilyeni, Stefan, Constantin Barbulescu, Attila Simo, Razvan Teslovan, and Cosmin Oros. "Genetic algorithm based distribution network expansion planning." In 2014 49th International Universities Power Engineering Conference (UPEC). IEEE, 2014. http://dx.doi.org/10.1109/upec.2014.6934812.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Rathore, Chandrakant, Pankaj B. Thote, Saurabh Kamble, Rasika Linge, and Anirudha Marothiya. "Implementation of ABC Algorithm To Solve Simultaneous Substation Expansion And Transmission Expansion Planning." In 2017 IEEE International WIE Conference on Electrical and Computer Engineering (WIECON-ECE). IEEE, 2017. http://dx.doi.org/10.1109/wiecon-ece.2017.8468889.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Lin, Qing, Jinhuan Wang, and Jing Wang. "Instance Expansion Algorithm for Micro-service with Prediction." In 2018 Joint International Advanced Engineering and Technology Research Conference (JIAET 2018). Atlantis Press, 2018. http://dx.doi.org/10.2991/jiaet-18.2018.59.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Okabe, Masanori, and Hidenori Aoki. "Network expansion planning using linkage identification genetic algorithm." In 2012 IEEE International Conference on Power and Energy (PECon). IEEE, 2012. http://dx.doi.org/10.1109/pecon.2012.6450210.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Yuan, Rui, and Xiaobing Hu. "A Novel Clustering Algorithm Based on Neighborhood Expansion." In 2014 7th International Symposium on Computational Intelligence and Design (ISCID). IEEE, 2014. http://dx.doi.org/10.1109/iscid.2014.32.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Jalilzadeh, Saeid, Arash Shabani, and Alahverdi Azadru. "Multi-period generation expansion planning using Genetic Algorithm." In 2010 International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT 2010). IEEE, 2010. http://dx.doi.org/10.1109/icumt.2010.5676613.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

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

Chen, Chong. Ternary alloy material prediction using genetic algorithm and cluster expansion. Office of Scientific and Technical Information (OSTI), 2015. http://dx.doi.org/10.2172/1334533.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Webster, Mort. A Multistage Stochastic Transmission Expansion Algorithm for Wide-Area Planning under Uncertainty. Office of Scientific and Technical Information (OSTI), 2020. http://dx.doi.org/10.2172/1737833.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Striuk, Andrii, Olena Rybalchenko, and Svitlana Bilashenko. Development and Using of a Virtual Laboratory to Study the Graph Algorithms for Bachelors of Software Engineering. [б. в.], 2020. http://dx.doi.org/10.31812/123456789/4462.

Повний текст джерела

Анотація:

The paper presents an analysis of the importance of studying graph algorithms, the reasons for the need to implement this project and its subsequent use. The existing analogues analysis is carried out, due to which a list of advantages and disadvantages is formed and taken into account in developing the virtual laboratory. A web application is created that clearly illustrates the work of graph algorithms, such as Depth-First Search, Dijkstra’s Shortest Path, Floyd- Warshall, Kruskal Minimum Cost Spanning Tree Algorithm. A simple and user- friendly interface is developed and it is supported by

Стилі APA, Harvard, Vancouver, ISO та ін.

Ostashev, Vladimir, Michael Muhlestein, and D. Wilson. Extra-wide-angle parabolic equations in motionless and moving media. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/42043.

Повний текст джерела

Анотація:

Wide-angle parabolic equations (WAPEs) play an important role in physics. They are derived by an expansion of a square-root pseudo-differential operator in one-way wave equations, and then solved by finite-difference techniques. In the present paper, a different approach is suggested. The starting point is an extra-wide-angle parabolic equation (EWAPE) valid for small variations of the refractive index of a medium. This equation is written in an integral form, solved by a perturbation technique, and transformed to the spectral domain. The resulting split-step spectral algorithm for the EWAPE a

Стилі APA, Harvard, Vancouver, ISO та ін.

Lewis, Dustin, Naz Modirzadeh, and Gabriella Blum. War-Algorithm Accountability. Harvard Law School Program on International Law and Armed Conflict, 2016. http://dx.doi.org/10.54813/fltl8789.

Повний текст джерела

Анотація:

In War-Algorithm Accountability (August 2016), we introduce a new concept—war algorithms—that elevates algorithmically-derived “choices” and “decisions” to a, and perhaps the, central concern regarding technical autonomy in war. We thereby aim to shed light on and recast the discussion regarding “autonomous weapon systems” (AWS). We define “war algorithm” as any algorithm that is expressed in computer code, that is effectuated through a constructed system, and that is capable of operating in relation to armed conflict. In introducing this concept, our foundational technological concern is the

Стилі APA, Harvard, Vancouver, ISO та ін.

BROWN, KEVIN H., JAMES R. KOTERAS, DONALD B. LONGCOPE, and THOMAS L. WARREN. Cavity Expansion: A Library for Cavity Expansion Algorithms, Version 1.0. Office of Scientific and Technical Information (OSTI), 2003. http://dx.doi.org/10.2172/809998.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Rokhlin, Vladimir, and Mark Tygert. Fast Algorithms for Spherical Harmonic Expansions. Defense Technical Information Center, 2004. http://dx.doi.org/10.21236/ada461342.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gilliam, Paul. A practical parallel algorithm for the minimization of Krönecker Reed-Muller expansions. Portland State University Library, 2000. http://dx.doi.org/10.15760/etd.6062.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Alexander, Serena, Bo Yang, Owen Hussey, and Derek Hicks. Examining the Externalities of Highway Capacity Expansions in California: An Analysis of Land Use and Land Cover (LULC) Using Remote Sensing Technology. Mineta Transportation Institute, 2023. http://dx.doi.org/10.31979/mti.2023.2251.

Повний текст джерела

Анотація:

There are over 590,000 bridges dispersed across the roadway network that stretches across the United States alone. Each bridge with a length of 20 feet or greater must be inspected at least once every 24 months, according to the Federal Highway Act (FHWA) of 1968. This research developed an artificial intelligence (AI)-based framework for bridge and road inspection using drones with multiple sensors collecting capabilities. It is not sufficient to conduct inspections of bridges and roads using cameras alone, so the research team utilized an infrared (IR) camera along with a high-resolution opt

Стилі APA, Harvard, Vancouver, ISO та ін.

Bennet, Karen, Gopi Krishnan Rajbahadur, Arthit Suriyawongkul, and Kate Stewart. Implementing AI Bill of Materials (AI BOM) with SPDX 3.0: A Comprehensive Guide to Creating AI and Dataset Bill of Materials. The Linux Foundation, 2024. https://doi.org/10.70828/rned4427.

Повний текст джерела

Анотація:

A Software Bill of Materials (SBOM) is becoming an increasingly important tool in regulatory and technical spaces to introduce more transparency and security into a project's software supply chain. Artificial intelligence (AI) projects face unique challenges beyond the security of their software, and thus require a more expansive approach to a bill of materials. In this report, we introduce the concept of an AI-BOM, expanding on the SBOM to include the documentation of algorithms, data collection methods, frameworks and libraries, licensing information, and standard compliance.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!