To see the other types of publications on this topic, follow the link: Fast search algorithm.

Journal articles on the topic 'Fast search algorithm'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Fast search algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Soongsathitanon, S., W. L. Woo, and S. S. Dlay. "Fast search algorithms for video coding using orthogonal logarithmic search algorithm." IEEE Transactions on Consumer Electronics 51, no. 2 (2005): 552–59. http://dx.doi.org/10.1109/tce.2005.1468001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

A., V. Paramkusam, and Laxma Reddy D. "A Three-Point Directional Search Block Matching Algorithm." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 1 (2017): 230–37. https://doi.org/10.11591/ijece.v7i1.pp230-237.

Full text
Abstract:
This paper proposes compact directional asymmetric search patterns, which we have named as three-point directional search (TDS). In most fast search motion estimation algorithms, a symmetric search pattern is usually set at the minimum block distortion point at each step of the search. The design of the symmetrical pattern in these algorithms relies primarily on the assumption that the direction of convergence is equally alike in each direction with respect to the search center. Therefore, the monotonic property of real -world video sequences is not properly used by these algorithms. The strategy of TDS is to keep searching for the minimum block distortion point in the most probable directions, unlike the previous fast search motion estimation algorithms where all the directions are checked. Therefore, the proposed method significantly reduces the number of search points for locating a motion vector. Compared to conventional fast algorithms, the proposed method has the fastest search speed and most satisfactory PSNR values for all test sequences.
APA, Harvard, Vancouver, ISO, and other styles
3

Matsugu, Shohei, Hiroaki Shiokawa, and Hiroyuki Kitagawa. "Fast Algorithm for Attributed Community Search." Journal of Information Processing 29 (2021): 188–96. http://dx.doi.org/10.2197/ipsjjip.29.188.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lin, Y., and S. W. Foo. "Fast search algorithm for tolerance design." IEE Proceedings - Circuits, Devices and Systems 145, no. 1 (1998): 19. http://dx.doi.org/10.1049/ip-cds:19981592.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sunday, Daniel M. "A very fast substring search algorithm." Communications of the ACM 33, no. 8 (1990): 132–42. http://dx.doi.org/10.1145/79173.79184.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Korepin, Vladimir E., and Jinfeng Liao. "Quest for Fast Partial Search Algorithm." Quantum Information Processing 5, no. 3 (2006): 209–26. http://dx.doi.org/10.1007/s11128-006-0024-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wu, H. S. "Fast search algorithm for vector quantisation." Electronics Letters 28, no. 5 (1992): 457. http://dx.doi.org/10.1049/el:19920288.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Radwan, Ahmed A., Ahmed Swilem, and Mamdouh M. Gomaa. "A Fast Image Encoding Algorithm Based on the Pyramid Structure of Codewords." International Journal of Mobile Computing and Multimedia Communications 1, no. 4 (2009): 1–13. http://dx.doi.org/10.4018/jmcmc.2009072801.

Full text
Abstract:
This article presents a very simple and efficient algorithm for codeword search in the vector quantization encoding. This algorithm uses 2-pixel merging norm pyramid structure to speed up the closest codeword search process. The authors first derive a condition to eliminate unnecessary matching operations from the search procedure. Then, based on this elimination condition, a fast search algorithm is suggested. Simulation results show that, the proposed search algorithm reduces the encoding complexity while maintaining the same encoding quality as that of the full search algorithm. It is also found that the proposed algorithm outperforms the existing search algorithms.
APA, Harvard, Vancouver, ISO, and other styles
9

Hernández Ulloa, Carlos, William Yeoh, Jorge Baier, Luis Suazo, Han Zhang, and Sven Koenig. "A Simple and Fast Bi-Objective Search Algorithm." Proceedings of the International Symposium on Combinatorial Search 11, no. 1 (2021): 125–26. http://dx.doi.org/10.1609/socs.v11i1.18521.

Full text
Abstract:
Many interesting search problems can be formulated as bi-objective search problems; for example, transportation problems where both travel distance and time need to be minimized. Multi-objective best-first search algorithms need to maintain the set of undominated paths from the start state to each state to compute a set of paths from a given start state to a given goal state (the Pareto-optimal solutions) such that no path in the set is dominated by another path in the set. Each time they find a new path to a state n, they perform a dominance check to determine whether such a path dominates any of the previously found paths to n. Existing algorithms do not perform these checks efficiently, requiring at least a full iteration over the Open list per check. In this paper, we present the first multi-objective algorithm that performs these checks efficiently. Indeed, Bi-Objective A* (BOA*)—our algorithm—requires constant time to check for dominance. Our experimental evaluation shows that BOA*is orders-of-magnitude faster than state-of-the-art search algorithms, such as NAMOA*, Bi-Objective Dijkstra, and Bidirectional Bi-Objective Dijkstra.
APA, Harvard, Vancouver, ISO, and other styles
10

Rajamanickam, Vani, Ushabhanu Nageswaran, and Sangeetha Marikkannan. "Fast Motion Estimation Algorithm using Hybrid Search Patterns for Video Streaming Application." International Journal of Computers Communications & Control 12, no. 5 (2017): 715. http://dx.doi.org/10.15837/ijccc.2017.5.2975.

Full text
Abstract:
The objective of the paper is to develop new block matching Motion Estimation (ME) algorithm using hybrid search patterns along the direction of best match. The search efficiency for sequences with fast motions and high resolutions is improved by proposing New Cross Diagonal-Hexagon Search (NCDHS) algorithm which involves a novel multi half-hexagon grid global search pattern and a cross diagonal-hexagon local search pattern. The new search pattern enables the proposed algorithm to perform better search using 9.068 search points on an average, to obtain optimal motion vector with slight improvement in quality. This inturn reduces ME Time upto 50.11%, 47.12%, 32.99% and 43.28% on average when compared to the existing Diamond Search (DS), Hexagon Search (HS), New Cross Hexagon Search (NHEXS) and Enhanced Diamond Search (EDS) algorithms respectively. The novelty of the algorithm is further achieved by applying the algorithm proposed for live streaming application. The NCDHS algorithm is run on two MATLAB sessions on the same computer by establishing the connection using Transmission Control Protocol (TCP) /Internet Protocol (IP) network. The ME Time obtained is 14.5986 seconds for a block size 16x16, is less when compared to existing algorithms and that makes the NCDHS algorithm suitable for real time streaming application.
APA, Harvard, Vancouver, ISO, and other styles
11

Wang, Wentao, Hao Liu, and Quanqin He. "Adolescent Identity Search Algorithm Based on Fast Search and Balance Optimization for Numerical and Engineering Design Problems." Computational Intelligence and Neuroscience 2022 (August 1, 2022): 1–25. http://dx.doi.org/10.1155/2022/5692427.

Full text
Abstract:
This paper proposed a fast convergence and balanced adolescent identity search algorithm (FCBAISA) for numerical and engineering design problems. The main contributions are as follows. Firstly, a hierarchical optimization strategy is proposed to balance the exploration and exploitation better. Secondly, a fast search strategy is proposed to avoid the local optimization and improve the accuracy of the algorithm; that is, the current optimal solution combines with the random disturbance of Brownian motion to guide other adolescents. Thirdly, the Chebyshev functional-link network (CFLN) is improved by recursive least squares estimation (RSLE), so as to find the optimal solution more effectively. Fourthly, the terminal bounce strategy is designed to avoid the algorithm falling into local optimization in the later stage of iteration. Fifthly, FCBAISA and comparison algorithms are tested by CEC2017 and CEC2022 benchmark functions, and the practical engineering problems are solved by algorithms above. The results show that FCBAISA is superior to other algorithms in all aspects and has high precision, fast convergence speed, and excellent performance.
APA, Harvard, Vancouver, ISO, and other styles
12

KE, SHIH-HAO, and TSU-TIAN LEE. "A MULTI-SCALE TWO-STEP FAST SEARCH ALGORITHM FOR BLOCK MOTION ESTIMATION." International Journal of Image and Graphics 02, no. 04 (2002): 633–53. http://dx.doi.org/10.1142/s0219467802000810.

Full text
Abstract:
Block motion estimation using full search is computationally intensive. Previously proposed fast algorithms reduce computation by limiting the number of search locations and search directions in a predefined search region. This is accomplished at the expense of accuracy of motion estimation and a large mean squared error for motion-compensated images, especially for image sequences with large displacement and rotation. In this paper, a novel efficient search algorithm for block motion estimation is presented to produce better performance than some fast search algorithms that have been developed, such as three step search, orthogonal search, 2D-logarithmic search, four step search, and block-based gradient descent search, in large displacement and rotation image cases. The proposed algorithm is based on the notion of locally multi-scale operation, search of global minimum, and two layer search strategy. Experimental results show that the proposed algorithm produces anticipative performance while costing much less computation power than the full search algorithm.
APA, Harvard, Vancouver, ISO, and other styles
13

Li , Guilin, Lang Tang, and Xiawu Zheng. "Fast Hybrid Search for Automatic Model Compression." Electronics 13, no. 4 (2024): 688. http://dx.doi.org/10.3390/electronics13040688.

Full text
Abstract:
Neural network pruning has been widely studied for model compression and acceleration, to facilitate model deployment in resource-limited scenarios. Conventional methods either require domain knowledge to manually design the pruned model architecture and pruning algorithm, or AutoML-based methods to search the pruned model architecture but still prune all layers with a single pruning algorithm. However, many pruning algorithms have been proposed and they all differ regarding the importance they attribute to the criterion of filters. Therefore, we propose a hybrid search method, searching for the pruned model architecture and the pruning algorithm at the same time, which automatically finds the pruning ratio and pruning algorithm for each convolution layer. Moreover, to be more efficient, we divide the search process into two phases. Firstly, we search in a huge space with adaptive batch normalization, which is a fast but relatively inaccurate model evaluation method; secondly, we search based on the previous results and evaluate models by fine-tuning, which is more accurate. Therefore, our proposed hybrid search method is efficient, and achieves a clear improvement in performance compared to current state-of-the-art methods, including AMC, MetaPruning, and ABCPruner. For example, when pruning MobileNet, we achieve a 59.8% test accuracy on ImageNet with only 49 M FLOPs, which is 2.6% higher than MetaPruning.
APA, Harvard, Vancouver, ISO, and other styles
14

Nardini, Franco Maria, Roberto Trani, and Rossano Venturini. "Fast Filtering of Search Results Sorted by Attribute." ACM Transactions on Information Systems 40, no. 2 (2022): 1–24. http://dx.doi.org/10.1145/3477982.

Full text
Abstract:
Modern search services often provide multiple options to rank the search results, e.g., sort “by relevance”, “by price” or “by discount” in e-commerce. While the traditional rank by relevance effectively places the relevant results in the top positions of the results list, the rank by attribute could place many marginally relevant results in the head of the results list leading to poor user experience. In the past, this issue has been addressed by investigating the relevance-aware filtering problem, which asks to select the subset of results maximizing the relevance of the attribute-sorted list. Recently, an exact algorithm has been proposed to solve this problem optimally. However, the high computational cost of the algorithm makes it impractical for the Web search scenario, which is characterized by huge lists of results and strict time constraints. For this reason, the problem is often solved using efficient yet inaccurate heuristic algorithms. In this article, we first prove the performance bounds of the existing heuristics. We then propose two efficient and effective algorithms to solve the relevance-aware filtering problem. First, we propose OPT-Filtering, a novel exact algorithm that is faster than the existing state-of-the-art optimal algorithm. Second, we propose an approximate and even more efficient algorithm, ϵ-Filtering, which, given an allowed approximation error ϵ, finds a (1-ϵ)–optimal filtering, i.e., the relevance of its solution is at least (1-ϵ) times the optimum. We conduct a comprehensive evaluation of the two proposed algorithms against state-of-the-art competitors on two real-world public datasets. Experimental results show that OPT-Filtering achieves a significant speedup of up to two orders of magnitude with respect to the existing optimal solution, while ϵ-Filtering further improves this result by trading effectiveness for efficiency. In particular, experiments show that ϵ-Filtering can achieve quasi-optimal solutions while being faster than all state-of-the-art competitors in most of the tested configurations.
APA, Harvard, Vancouver, ISO, and other styles
15

Ma, Ruizhe, Diwei Zheng, and Li Yan. "Fast Online Similarity Search for Uncertain Time Series." Journal of Computing and Information Technology 28, no. 1 (2020): 1–17. http://dx.doi.org/10.20532/cit.2020.1004574.

Full text
Abstract:
To achieve fast retrieval of online data, it is needed for the retrieval algorithm to increase throughput while reducing latency. Based on the traditional online processing algorithm for time series data, we propose a spatial index structure that can be updated and searched quickly in a real-time environment. At the same time, we introduce an adaptive segmentation method to divide the space corresponding to nodes. Unlike traditional retrieval algorithms, for uncertain time series, the distance threshold used for screening will dynamically change due to noise during the search process. Extensive experiments are conducted to compare the accuracy of the query results and the timeliness of the algorithm. The results show that the index structure proposed in this paper has better efficiency while maintaining a similar true positive ratio.
APA, Harvard, Vancouver, ISO, and other styles
16

Yanxiang Geng, Yanxiang Geng, Liyi Zhang Yanxiang Geng, Yong Zhang Liyi Zhang, Zhixing Li Yong Zhang, and Jiahui Li Zhixing Li. "Improved Bat Algorithm Based on Fast Diving Strategy." 網際網路技術學刊 24, no. 6 (2023): 1249–62. http://dx.doi.org/10.53106/160792642023112406008.

Full text
Abstract:
<p>Bat algorithm has good global search ability, but it has some problems, such as slow convergence speed in local search stage, low convergence accuracy, easy to fall into local optimization and can not escape. In view of the above defects, inspired by Harris Hawks’s strategy of catching rabbits, this paper introduces the surrounding mechanism of prey, which can quickly approach the food and judge its quality, so as to achieve the purpose of rapid convergence and improve the convergence accuracy. The experiment shows that the improved algorithm of the fast diving strategy is tested by using the test function, and compared with the basic bat algorithm, backtracking bat algorithm and HABC. The improved bat algorithm of the fast diving strategy has better optimization accuracy, faster convergence speed, simple algorithm and higher success rate.</p> <p> </p>
APA, Harvard, Vancouver, ISO, and other styles
17

Liu, Chang Jiang, Chao Chen, A. Fei Zhang, and Xiao Lang Yan. "A Fast Block-Matching Motion Estimation Method Based on Difference Search Algorithm." Applied Mechanics and Materials 610 (August 2014): 686–94. http://dx.doi.org/10.4028/www.scientific.net/amm.610.686.

Full text
Abstract:
The diamond search (DS) algorithm is one of the most efficient block matching motion estimation algorithms by far and has already been applied in MPEG2/4. Through our research, we found that there is still some redundancy in the algorithm. In this paper, an improved new difference based search (DBS) algorithm is proposed. Simulation results demonstrate that the new algorithm outperforms the well-known diamond search (DS) algorithm and four step-searches (4SS). It obtains almost the same Peak Signal to Noise Ratio (PSNR) while requires less computations than the DS algorithm and 4SS algorithm.
APA, Harvard, Vancouver, ISO, and other styles
18

Pan, Naiqiao, Tian Chen, Houjun Sun, and Xiangdong Zhang. "Electric-Circuit Realization of Fast Quantum Search." Research 2021 (July 26, 2021): 1–8. http://dx.doi.org/10.34133/2021/9793071.

Full text
Abstract:
Quantum search algorithm, which can search an unsorted database quadratically faster than any known classical algorithms, has become one of the most impressive showcases of quantum computation. It has been implemented using various quantum schemes. Here, we demonstrate both theoretically and experimentally that such a fast search algorithm can also be realized using classical electric circuits. The classical circuit networks to perform such a fast search have been designed. It has been shown that the evolution of electric signals in the circuit networks is analogies of quantum particles randomly walking on graphs described by quantum theory. The searching efficiencies in our designed classical circuits are the same to the quantum schemes. Because classical circuit networks possess good scalability and stability, the present scheme is expected to avoid some problems faced by the quantum schemes. Thus, our findings are advantageous for information processing in the era of big data.
APA, Harvard, Vancouver, ISO, and other styles
19

1M., Murali, Ramesh kumar B., Sailaja Kumari M., and Sydulu M. "HYDROTHERMAL COORDINATION FOR SHORT RANGE FIXED HEAD STATIONS USING FAST GENETIC ALGORITHM." Electrical & Computer Engineering: An International Journal (ECIJ) 2, no. 1 (2013): 01–15. https://doi.org/10.5281/zenodo.3342528.

Full text
Abstract:
This paper presents a Fast genetic algorithm for solving Hydrothermal coordination (HTC) problem. Genetic Algorithms (GAs) perform powerful global searches, but their long computation times, put a limitation when solving large scale optimization problems. The present paper describes a Fast GA (FGA) to overcome this limitation, by starting with random solutions within the search space and narrowing down the search space by considering the minimum and maximum errors of the population members. Since the search space is restricted to a small region within the available search space the algorithm works very fast. This algorithm reduces the computational burden and number of generations to converge. The proposed algorithm has been demonstrated for HTC of various combinations of Hydro thermal systems. In all the cases Fast GA shows reliable convergence. The final results obtained using Fast GA are compared with simple (conventional) GA and found to be encouraging.
APA, Harvard, Vancouver, ISO, and other styles
20

Hernández Ulloa, Carlos, William Yeoh, Jorge A. Baier, Han Zhang, Luis Suazo, and Sven Koenig. "A Simple and Fast Bi-Objective Search Algorithm." Proceedings of the International Conference on Automated Planning and Scheduling 30 (June 1, 2020): 143–51. http://dx.doi.org/10.1609/icaps.v30i1.6655.

Full text
Abstract:
Many interesting search problems can be formulated as bi-objective search problems, that is, search problems where two kinds of costs have to be minimized, for example, travel distance and time for transportation problems. Bi-objective search algorithms have to maintain the set of undominated paths from the start state to each state to compute the set of paths from the start state to the goal state that are not dominated by some other path from the start state to the goal state (called the Pareto-optimal solution set). Each time they find a new path to a state s, they perform a dominance check to determine whether this path dominates any of the previously found paths to s or whether any of the previously found paths to s dominates this path. Existing algorithms do not perform these checks efficiently. On the other hand, our Bi-Objective A* (BOA*) algorithm requires only constant time per check. In our experimental evaluation, we show that BOA* can run an order of magnitude (or more) faster than state-of-the-art bi-objective search algorithms, such as NAMOA*, NAMOA*dr, Bi-Objective Dijkstra, and Bidirectional Bi-Objective Dijkstra.
APA, Harvard, Vancouver, ISO, and other styles
21

Ko, Dae-Young, Sung-June Baek, Jun-Kyu Park, Yu-Gyeong Seo, and Sung-Il Seo. "The Fast Search Algorithm for Raman Spectrum." Journal of the Korea Academia-Industrial cooperation Society 16, no. 5 (2015): 3378–84. http://dx.doi.org/10.5762/kais.2015.16.5.3378.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Tedmori, S., and N. Al-Najdawi. "Hierarchical stochastic fast search motion estimation algorithm." IET Computer Vision 6, no. 1 (2012): 21. http://dx.doi.org/10.1049/iet-cvi.2010.0188.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Jia, Lianhui, Yang Zhang, and Guijuan Li. "A fast algorithm to compute shadow areas for Kirchhoff approximation-based underwater acoustic scattering simulation." MATEC Web of Conferences 283 (2019): 03005. http://dx.doi.org/10.1051/matecconf/201928303005.

Full text
Abstract:
Kirchhoff approximation method is a fast underwater acoustic scattering numerical method which adaptive to engineering application. Shadow areas calculation is one of the most important factors for computational efficiency. In this paper, several existing shadow domain calculation methods for underwater acoustic numerical simulation based on Kirchhoff approximation are introduced. On this basis, a fast sheltering method based on the linked-list search algorithm is proposed. Linked-list search algorithm uses element geometric center to express the element space position and projects the geometric center on incident wave plane along the incident sound ray. And linked-list relationship of elements is established by dividing background mesh cell on the screen. The algorithm achieves fast calculation by using linked-list relationship and optimizing the calculation path. Linked-list search algorithm and all-pair search algorithm are compared and analyzed by an example of numerical simulation. The computational efficiency of the fast shadow domain algorithm is verified by comparing the results of the two algorithms. And the suggestions for further improving the computational efficiency of the algorithm are proposed.
APA, Harvard, Vancouver, ISO, and other styles
24

CHANG, MING-CHING, CHIOU-SHANN FUH, and HSIEN-YEI CHEN. "FAST SEARCH ALGORITHMS FOR INDUSTRIAL INSPECTION." International Journal of Pattern Recognition and Artificial Intelligence 15, no. 04 (2001): 675–90. http://dx.doi.org/10.1142/s0218001401001039.

Full text
Abstract:
This paper presents an efficient general purpose search algorithm for alignment and an applied procedure for IC print mark quality inspection. The search algorithm is based on normalized cross-correlation and enhances it with a hierarchical resolution pyramid, dynamic programming, and pixel over-sampling to achieve subpixel accuracy on one or more targets. The general purpose search procedure is robust with respect to linear change of image intensity and thus can be applied to general industrial visual inspection. Accuracy, speed, reliability, and repeatability are all critical for the industrial use. After proper optimization, the proposed procedure was tested on the IC inspection platforms in the Mechanical Industry Research Laboratories (MIRL), Industrial Technology Research Institute (ITRI), Taiwan. The proposed method meets all these criteria and has worked well in field tests on various IC products.
APA, Harvard, Vancouver, ISO, and other styles
25

Rosselan, Muhammad Zakyizzuddin Bin, Shahril Irwan Bin Sulaiman, and Norhalida Othman. "Evaluation of Fast Evolutionary Programming, Firefly Algorithm and Mutate-Cuckoo Search Algorithm In Single-Objective Optimization." International Journal of Electrical & Electronic Systems Research (IEESR) 9, no. 1 (2019): 1. http://dx.doi.org/10.24191/ieesr.v9i1.1038.

Full text
Abstract:
In this study proposes an evaluation of different computational intelligences, i.e Fast-Evolutionary Algorithm (FEP), Firefly Algorithm (FA) and Mutate-Cuckoo Search Algorithm (MCSA) for solving single-objective optimization problem. FEP and MCSA are based on the conventional Evolutionary Programming (EP) and Cuckoo Search Algorithm (CSA) with modifications and adjustment to boost up their search ability. In this paper, four different benchmark functions were used to compare the optimization performance of these three algorithms. The results showed that MCSA is better compare with FEP and FA in term of fitness value while FEP is fastest algorithm in term of computational time compare with other two algorithms.
APA, Harvard, Vancouver, ISO, and other styles
26

Takeshita, Hidetoshi, Sho Shimizu, Hiroyuki Ishikawa, et al. "Fast Optimal Replica Placement with Exhaustive Search Using Dynamically Reconfigurable Processor." Journal of Computer Networks and Communications 2011 (2011): 1–11. http://dx.doi.org/10.1155/2011/707592.

Full text
Abstract:
This paper proposes a new replica placement algorithm that expands the exhaustive search limit with reasonable calculation time. It combines a new type of parallel data-flow processor with an architecture tuned for fast calculation. The replica placement problem is to find a replica-server set satisfying service constraints in a content delivery network (CDN). It is derived from the set cover problem which is known to be NP-hard. It is impractical to use exhaustive search to obtain optimal replica placement in large-scale networks, because calculation time increases with the number of combinations. To reduce calculation time, heuristic algorithms have been proposed, but it is known that no heuristic algorithm is assured of finding the optimal solution. The proposed algorithm suits parallel processing and pipeline execution and is implemented on DAPDNA-2, a dynamically reconfigurable processor. Experiments show that the proposed algorithm expands the exhaustive search limit by the factor of 18.8 compared to the conventional algorithm search limit running on a Neumann-type processor.
APA, Harvard, Vancouver, ISO, and other styles
27

Koulianos, Athanasios, Antonios Litke, and Nikolaos K. Papadakis. "A Hybrid Whale Optimization Approach for Fast-Convergence Global Optimization." Journal of Experimental and Theoretical Analyses 3, no. 2 (2025): 17. https://doi.org/10.3390/jeta3020017.

Full text
Abstract:
In this paper, we introduce the Levy Flight-enhanced Whale Optimization Algorithm with Tabu Search elements (LWOATS), an innovative hybrid optimization approach that enhances the standard Whale Optimization Algorithm (WOA) with advanced local search techniques and elite solution management to improve performance on global optimization problems. Techniques from the Tabu Search algorithm are adopted to balance the exploration and exploitation phases, while an elite reintroduction strategy is implemented to retain and refine the best solutions. The efficient optimization of LWOATS is further aided by the utilization of Levy flights and local search based on the Nelder–Mead simplex method. An Orthogonal Experimental Design (OED) analysis was employed to fine-tune the algorithm’s parameters. LWOATS was tested against three different algorithm sets: fundamental algorithms, advanced Differential Evolution (DE) variants, and improved WOA variants. Wilcoxon tests demonstrate the promising performance of LWOATS, showing improvements in convergence speed, accuracy, and robustness compared to traditional WOA and other metaheuristic algorithms. After extensive testing against a challenging set of benchmark functions and engineering optimization problems, we conclude that our proposed method is well suited for tackling high-dimensional optimization tasks and constrained optimization problems, providing substantial computational efficiency gains and improved overall solution quality.
APA, Harvard, Vancouver, ISO, and other styles
28

Rajabai C, Prayline, Harish J, and Sivanantham S. "Hardware Implementation of Diamond Search Algorithm for Motion Estimation." International Journal of Engineering & Technology 7, no. 4.10 (2018): 1075. http://dx.doi.org/10.14419/ijet.v7i4.10.27922.

Full text
Abstract:
Motion estimation one of the advanced technique adapted in the industry for video coding and implemented in various applications. This work is focused on the efficient hardware implementation of the diamond search algorithm architecture. Among all the other Fast Search algorithms like three-step search, new three-step search, four-step search and diamond search (DS), the diamond search algorithm maintains the diamond shape search pattern and it gives faster search pattern and minimum absolute difference. When compared with the original diamond search (DS) algorithm, this modified diamond search algorithm requires less area and power maintaining the same performance. Other than the architectural level changes the low power synthesis is done and the results show that this design can be implemented effectively for an application that require fast search with low power requirements like IoT and sensor devices. The design has been implemented using Verilog HDL, synthesized using Synopsys DC compiler using 90nm technology.
APA, Harvard, Vancouver, ISO, and other styles
29

Taguelmimt, Redha, Samir Aknine, Djamila Boukredera, and Narayan Changder. "FACS: Fast Code-based Algorithm for Coalition Structure Generation (Student Abstract)." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 18 (2021): 15907–8. http://dx.doi.org/10.1609/aaai.v35i18.17950.

Full text
Abstract:
In this paper, we propose a new algorithm for the Coalition Structure Generation (CSG) problem that can be run with more than 28 agents while using a complete set of coalitions as input. The current state-of-the-art limit for exact algorithms to solve the CSG problem within a reasonable time is 27 agents. Our algorithm uses a novel representation of the search space and a new code-based search technique. We propose an effective heuristic search method to efficiently explore the space of coalition structures using our code based technique and show that our method outperforms existing state-of-the-art algorithms by multiple orders of magnitude.
APA, Harvard, Vancouver, ISO, and other styles
30

Li, Jian Fu, and Tie Jun Li. "Research on Fast KCSP Algorithms for Searching Connecting Paths in Airline Networks." Applied Mechanics and Materials 505-506 (January 2014): 1005–13. http://dx.doi.org/10.4028/www.scientific.net/amm.505-506.1005.

Full text
Abstract:
With the rapid development of the civil aviation industry in the world, airline networks become increasingly complex and large, which provide more choices for passengers. To search in airline networks for better connecting paths, it is very time-consuming by existing general K Constrained Shortest Paths (KCSP) algorithms. According to that the acceptable transfer times is generally not more than 3, combined with the structure characteristics of the Yen algorithm, a fast algorithm named as KCSP_Yen is proposed for searching connecting paths in airline networks. At the same time, based on the bounded breadth-first search and A* search, two fast KCSP algorithms are proposed. Finally, the three algorithms are test through experiments on the world airline network.
APA, Harvard, Vancouver, ISO, and other styles
31

Zhu, Kaige, Guoyou Shi, Jiao Liu, and Jiahui Shi. "Fast High-Precision Bisection Feedback Search Algorithm and Its Application in Flattening the NURBS Curve." Journal of Marine Science and Engineering 10, no. 12 (2022): 1851. http://dx.doi.org/10.3390/jmse10121851.

Full text
Abstract:
It is important to accurately calculate flattening points when reconstructing ship hull models, which require fast and high-precision computation. However, some search algorithms, such as the bisection method, iterate near the optimal value too many times before converging in high-precision computation. The paper proposes a fast high-precision bisection feedback search (FHP-BFS) algorithm to solve the problem. In the FHP-BFS algorithm, the Newton–Raphson (NR) method is adopted to accelerate the convergence speed by considering the iteration characteristics of subintervals. Furthermore, a new feedback mechanism is proposed to control the feedback directions. In addition, an acceleration algorithm, called the interval reformation method, is used to guide the FHP-BFS algorithm for fast convergence. Finally, the flattening algorithm is improved by the FHP-BFS algorithm. In the comparative experiments, the practical efficacy of the FHP-BFS algorithm is first demonstrated, and then the optimal range of the threshold precision is determined. Next the FHP-BFS algorithm is compared to the best existing algorithms. Finally, the performance of the improved flattening algorithm is verified. The experiments demonstrate that the FHP-BFS algorithm has optimal performance among the compared algorithms, and it has an improved computation efficiency while maintaining robustness. The improved flattening algorithm reduces the computation time, ensures smoothness and meets practical engineering requirements.
APA, Harvard, Vancouver, ISO, and other styles
32

Pan, Shiwei, Yiyuan Wang, and Minghao Yin. "A Fast Local Search Algorithm for the Latin Square Completion Problem." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 9 (2022): 10327–35. http://dx.doi.org/10.1609/aaai.v36i9.21274.

Full text
Abstract:
The Latin square completion (LSC) problem is an important NP-complete problem with numerous applications. Given its theoretical and practical importance, several algorithms are designed for solving the LSC problem. In this work, to further improve the performance, a fast local search algorithm is developed based on three main ideas. Firstly, a reduction reasoning technique is used to reduce the scale of search space. Secondly, we propose a novel conflict value selection heuristic, which considers the history conflicting information of vertices as a selection criterion when more than one vertex have equal values on the primary scoring function. Thirdly, during the search phase, we record previous history search information and then make use of these information to restart the candidate solution. Experimental results show that our proposed algorithm significantly outperforms the state-of-the-art heuristic algorithms on almost all instances in terms of success rate and run time.
APA, Harvard, Vancouver, ISO, and other styles
33

Lim, Dong-Young, Sang-Jun Park, and Je-Chang Jeong. "Direction-Oriented Fast Full Search Algorithm at the Divided Search Range." Journal of Broadcast Engineering 12, no. 3 (2007): 278–88. http://dx.doi.org/10.5909/jbe.2007.12.3.278.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

LIM, ANDREW, BRIAN RODRIGUES, and FEI XIAO. "A FAST ALGORITHM FOR BANDWIDTH MINIMIZATION." International Journal on Artificial Intelligence Tools 16, no. 03 (2007): 537–44. http://dx.doi.org/10.1142/s0218213007003394.

Full text
Abstract:
We propose a simple and direct node shifting method with hill climbing for the well-known matrix bandwidth minimization problem. Many heuristics have been developed for this NP-complete problem including the Cuthill-McKee (CM) and the Gibbs, Poole and Stockmeyer (GPS) algorithms. Recently, heuristics such as Simulated Annealing, Tabu Search and GRASP have been used, where Tabu Search and the GRASP with Path Relinking achieved significantly better solution quality than the CM and GPS algorithms. Experimentation shows that our method achieves the best solution quality when compared with these while being much faster than newly-developed algorithms.
APA, Harvard, Vancouver, ISO, and other styles
35

Patnaik, Yogananda, and Dipti Patra. "Pattern Based Motion Estimation using Zero Motion Pre-judgement and Quantum behaved Particle Swarm Optimization." ECTI Transactions on Computer and Information Technology (ECTI-CIT) 11, no. 1 (2017): 91–102. http://dx.doi.org/10.37936/ecti-cit.2017111.84224.

Full text
Abstract:
Motion estimation is a fundamental and resource hungry operation in most of the video coding applications. The most popular method used in any video coding application is block matching motion estimation (BMME). This conventional fast motion estimation algorithm adopts a monotonic error surface for faster computation. However, these search techniques may trap at local minima resulting in erroneous motion estimation. To overcome this issue, various evolutionary swarm intelligence based algorithms were proposed. In this paper, a pattern based motion estimation using zero motion prejudgment and Quantum behaved Particle Swarm Optimization (QPSO) algorithms is proposed, referred to as the Pattern Based Motion Estimation (PBME) algorithm. The notion of QPSO improves the diversity in the search space, which enhances the search efficiency and helps in reduction of the computational burden. At the same time, QPSO needs fewer parameters to control. Therefore, the proposed algorithm enhances the estimation accuracy. An initial search pattern (Hexagonal Based Search) was used which speeds the convergence rate of the algorithm. From the simulation results, it was found that the proposed method outperformed the existing fast block matching (BMA) algorithms of the search point reduction by 40–75%
APA, Harvard, Vancouver, ISO, and other styles
36

CARUS, Aydın, and Altan MESUT. "A new compression algorithm for fast text search." TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES 24 (2016): 4355–67. http://dx.doi.org/10.3906/elk-1407-178.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

D.P., Tripathi, Nayak Mahesh, Manoj Rajaboina, Sudheer Surarapu, and Praghash K. "Fast Computational Efficient Directional Shrinking Search Optimization Algorithm." International Journal of Performability Engineering 17, no. 6 (2021): 543. http://dx.doi.org/10.23940/ijpe.21.06.p7.543551.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

FUJIWARA, Yasuhiro, Makoto NAKATSUJI, Hiroaki SHIOKAWA, Takeshi MISHIMA, and Makoto ONIZUKA. "Fast Ad-Hoc Search Algorithm for Personalized PageRank." IEICE Transactions on Information and Systems E100.D, no. 4 (2017): 610–20. http://dx.doi.org/10.1587/transinf.2016awi0002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Chen, C. Q., S. N. Koh, and I. Y. Soon. "Fast codebook search algorithm for unconstrained vector quantisation." IEE Proceedings - Vision, Image, and Signal Processing 145, no. 2 (1998): 97. http://dx.doi.org/10.1049/ip-vis:19981691.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Tai, Shen-Chen. "Fast motion estimation algorithm using motion adaptive search." Optical Engineering 47, no. 3 (2008): 037007. http://dx.doi.org/10.1117/1.2899019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Cha, Sung-Hyuk, and Sargur N. Srihari. "A fast nearest neighbor search algorithm by filtration." Pattern Recognition 35, no. 2 (2002): 515–25. http://dx.doi.org/10.1016/s0031-3203(01)00032-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Poggi, G. "Fast algorithm encoding for full-search VQ encoding." Electronics Letters 29, no. 12 (1993): 1141. http://dx.doi.org/10.1049/el:19930761.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Chung, Kuo-Liang, and Chih-Jen Wu. "A fast search algorithm on modified S-trees." Pattern Recognition Letters 16, no. 11 (1995): 1159–64. http://dx.doi.org/10.1016/0167-8655(95)00076-s.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Smith, P. D. "Experiments with a very fast substring search algorithm." Software: Practice and Experience 21, no. 10 (1991): 1065–74. http://dx.doi.org/10.1002/spe.4380211006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Fomin, Fedor, Daniel Lokshtanov, Venkatesh Raman, and Saket Saurabh. "Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (2010): 65–70. http://dx.doi.org/10.1609/aaai.v24i1.7557.

Full text
Abstract:
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solutionto an instance of Weighted Feedback Arc Set in Tournaments. More precisely,given an arc weighted tournament T on n vertices and a feedback arc set F (a set of arcs whose deletion from T turns it into a directed acyclic graph), our algorithm decides in time O(2o(k) n log n) if there is a feedback arc set of smaller weight and that differs from F in at most k arcs. To our knowledge this is the first algorithm searching the k-exchange neighborhood of an NP-complete problem that runs in (parameterized) subexponential time. Using this local search algorithm for Weighted Feedback Arc Set in Tournaments, we obtain subexponential time algorithms for a local search variant of Kemeny Ranking — a problem in social choice theory and of One-Sided Cross Minimization — a problem in graph drawing.
APA, Harvard, Vancouver, ISO, and other styles
46

Hernandez, Carlos, and Jorge Baier. "Fast Subgoaling for Pathfinding via Real-Time Search." Proceedings of the International Conference on Automated Planning and Scheduling 21 (March 22, 2011): 327–30. http://dx.doi.org/10.1609/icaps.v21i1.13488.

Full text
Abstract:
Real-time heuristic search is a standard approach to pathfind- ing when agents are required to make decisions in a bounded, very short period of time. An assumption usually made in the development and evaluation of real-time algorithms is that the environment is unknown. Nevertheless, in many interesting applications such as pathfinding for automnomous characters in video games, the environment is known in advance. Recent real-time search algorithms such as D LRTA* and kNN LRTA* exploit knowledge about the environment while pathfinding under real-time constraints. Key to those algorithms is the computation of subgoals in a preprocessing step. Subgoals are subsequently used in the online planning phase to obtain high-quality solutions. Preprocessing in those algorithms, however, requires significant computation. In this paper we propose a novel preprocessing algorithm that generates subgoals using a series of backward search episodes carried out from potential goals. The result of a single backward search episode is a tree of subgoals that we then use while planning online. We show the advantages of our approach over state-of-the-art algorithms by carrying out experiments on standard real-time search benchmarks.
APA, Harvard, Vancouver, ISO, and other styles
47

Burns, Ethan, Matthew Hatem, Michael Leighton, and Wheeler Ruml. "Implementing Fast Heuristic Search Code." Proceedings of the International Symposium on Combinatorial Search 3, no. 1 (2021): 25–32. http://dx.doi.org/10.1609/socs.v3i1.18245.

Full text
Abstract:
Published papers rarely disclose implementation details. In this paper we show how such details can account for speedups of up to a factor of 28 for different implementations of the same algorithm. We perform an in-depth analysis of the most popular benchmark in heuristic search: the 15-puzzle. We study implementation choices in C++ for both IDA* and A* using the Manhattan distance heuristic. Results suggest that several optimizations deemed critical in folklore provide only small improvements while seemingly innocuous choices can play a large role. These results are important for ensuring that the correct conclusions are drawn from empirical comparisons
APA, Harvard, Vancouver, ISO, and other styles
48

Kung, Chih-Ming, Wan-Shu Cheng, and Jyh-Horng Jeng. "Application of Genetic Algorithm to Hexagon-Based Motion Estimation." Scientific World Journal 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/689294.

Full text
Abstract:
With the improvement of science and technology, the development of the network, and the exploitation of the HDTV, the demands of audio and video become more and more important. Depending on the video coding technology would be the solution for achieving these requirements. Motion estimation, which removes the redundancy in video frames, plays an important role in the video coding. Therefore, many experts devote themselves to the issues. The existing fast algorithms rely on the assumption that the matching error decreases monotonically as the searched point moves closer to the global optimum. However, genetic algorithm is not fundamentally limited to this restriction. The character would help the proposed scheme to search the mean square error closer to the algorithm of full search than those fast algorithms. The aim of this paper is to propose a new technique which focuses on combing the hexagon-based search algorithm, which is faster than diamond search, and genetic algorithm. Experiments are performed to demonstrate the encoding speed and accuracy of hexagon-based search pattern method and proposed method.
APA, Harvard, Vancouver, ISO, and other styles
49

Li, Xinzhong, Yongliang Xiong, Weiwei Chen, Shaoguang Xu, and Rui Zhang. "Improved GNSS Ambiguity Fast Estimation Reduction Algorithm." Sensors 23, no. 20 (2023): 8568. http://dx.doi.org/10.3390/s23208568.

Full text
Abstract:
The fast and accurate solution of integer ambiguity is the key to achieve GNSS high-precision positioning. Based on the lattice theory of high-dimensional ambiguity solving, the reduction time consumption is much larger than the search time consumption, and it is especially important to improve the efficiency of the lattice basis reduction algorithm. The Householder QR decomposition with minimal column pivoting is utilized to pre-sort the basis vectors and reduce the number of basis vector exchanges during the reduction process by partial size reduction and relaxing the basis vector exchange condition to improve the reduction efficiency of the LLL algorithm. The improved algorithm is validated using simulated and measured data, respectively, and the performance advantages and disadvantages of the improved algorithm are evaluated from the perspectives of the extent of reduction basis orthogonality and the quality of reduction basis size reduction. The results show that the improved LLL algorithm can significantly reduce the number of basis vector exchanges and the reduction time consumption. The HSLLL and PSLLL algorithms with the Siegel condition as the basis vector exchange condition have a better reduction effect, but are slightly less stable. The PLLLR algorithm significantly improves the search ambiguity resolution efficiency, which is conducive to the rapid realization of ambiguity resolution.
APA, Harvard, Vancouver, ISO, and other styles
50

He, Wei, Yu Zhang, and Yin Li. "Fast, Searchable, Symmetric Encryption Scheme Supporting Ranked Search." Symmetry 14, no. 5 (2022): 1029. http://dx.doi.org/10.3390/sym14051029.

Full text
Abstract:
Searchable encryption (SE) is one of the effective techniques for searching encrypted data without decrypting it. This technique can provide a secure indexing mechanism for encrypted data and utilize a secure trapdoor to search for the encrypted data directly, thus realizing a secure ciphertext retrieval function. Existing schemes usually build a secure index directly on the whole dataset and implement the retrieval of encrypted data by implementing a secure search algorithm on the index. However, this approach requires testing many non-relevant documents, which diminishes the query efficiency. In this paper, we adopt a clustering method to preclassify the dataset, which can filter out quite a portion of irrelevant documents, thus improving the query. Concretely, we first partition the dataset into multiple document clusters using the k-means clustering algorithm; then, we design index building and searching algorithms for these document clusters; finally, by using the asymmetric scalar-product-preserving encryption (ASPE) scheme to encrypt the indexes and queries, we propose a fast searchable symmetric encryption scheme that supports ranked search. Detailed security analysis demonstrates that the proposed scheme can guarantee the data and query security of the search process. In addition, theoretical and experimental analysis indicates that our scheme outperforms other similar schemes in terms of query efficiency.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography