Log in

Relevant bibliographies by topics / Adaptive algorithm / Dissertations / Theses

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

Dissertations / Theses on the topic 'Adaptive algorithm'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Adaptive 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 dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Mirzazadeh, Mehdi. "Adaptive Comparison-Based Algorithms for Evaluating Set Queries." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1147.

Full text

Abstract:

In this thesis we study a problem that arises in answering boolean queries submitted to a search engine. Usually a search engine stores the set of IDs of documents containing each word in a pre-computed sorted order and to evaluate a query like "computer AND science" the search engine has to evaluate the union of the sets of documents containing the words "computer" and "science". More complex queries will result in more complex set expressions. In this thesis we consider the problem of evaluation of a set expression with union and intersection as operators and ordered sets as operands.

APA, Harvard, Vancouver, ISO, and other styles

2

Law, Nga Lam. "Parameter-free adaptive genetic algorithm /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?PHYS%202007%20LAW.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

au, Daniel Schubert@csiro, and Daniel Schubert. "A Multivariate Adaptive Trimmed Likelihood Algorithm." Murdoch University, 2005. http://wwwlib.murdoch.edu.au/adt/browse/view/adt-MU20061019.132720.

Full text

Abstract:

The research reported in this thesis describes a new algorithm which can be used to robustify statistical estimates adaptively. The algorithm does not require any pre-specified cut-off value between inlying and outlying regions and there is no presumption of any cluster configuration. This new algorithm adapts to any particular sample and may advise the trimming of a certain proportion of data considered extraneous or may divulge the structure of a multi-modal data set. Its adaptive quality also allows for the confirmation that uni-modal, multivariate normal data sets are outlier free. It is a

APA, Harvard, Vancouver, ISO, and other styles

4

Schubert, Daniel Dice. "A multivariate adaptive trimmed likelihood algorithm /." Access via Murdoch University Digital Theses Project, 2005. http://wwwlib.murdoch.edu.au/adt/browse/view/adt-MU20061019.132720.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Vogt, Paul E. "An adaptive multi-scene correlation algorithm." Master's thesis, University of Central Florida, 1988. http://digital.library.ucf.edu/cdm/ref/collection/RTD/id/76421.

Full text

Abstract:

University of Central Florida College of Engineering Thesis<br>Digital scene matching algorithms have been used in both military and commercial image processing systems for years. The trend toward using multiple sensors in military imaging systems has generated anew interest in real time techniques to accomplish sensor fusion tasks such as field of view alignment. This thesis analyzes methods presently in use and intorduces a novel algorithm that improves scene correlation performance. The focus of the new technique is in the segmentation area, where significant features are extracted from

APA, Harvard, Vancouver, ISO, and other styles

6

Turner, Steven Primitivo. "Adaptive out of step relay algorithm." Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-01242009-063244/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Schubert, Daniel. "A multivariate adaptive trimmed likelihood algorithm." Thesis, Schubert, Daniel (2005) A multivariate adaptive trimmed likelihood algorithm. PhD thesis, Murdoch University, 2005. https://researchrepository.murdoch.edu.au/id/eprint/295/.

Full text

Abstract:

The research reported in this thesis describes a new algorithm which can be used to robustify statistical estimates adaptively. The algorithm does not require any pre-specified cut-off value between inlying and outlying regions and there is no presumption of any cluster configuration. This new algorithm adapts to any particular sample and may advise the trimming of a certain proportion of data considered extraneous or may divulge the structure of a multi-modal data set. Its adaptive quality also allows for the confirmation that uni-modal, multivariate normal data sets are outlier free. It is a

APA, Harvard, Vancouver, ISO, and other styles

8

Schubert, Daniel. "A multivariate adaptive trimmed likelihood algorithm." Schubert, Daniel (2005) A multivariate adaptive trimmed likelihood algorithm. PhD thesis, Murdoch University, 2005. http://researchrepository.murdoch.edu.au/295/.

Full text

Abstract:

The research reported in this thesis describes a new algorithm which can be used to robustify statistical estimates adaptively. The algorithm does not require any pre-specified cut-off value between inlying and outlying regions and there is no presumption of any cluster configuration. This new algorithm adapts to any particular sample and may advise the trimming of a certain proportion of data considered extraneous or may divulge the structure of a multi-modal data set. Its adaptive quality also allows for the confirmation that uni-modal, multivariate normal data sets are outlier free. It is a

APA, Harvard, Vancouver, ISO, and other styles

9

Doss, Christopher. "Algorithm Partitioning and Scheduling for Adaptive Computers." NCSU, 2001. http://www.lib.ncsu.edu/theses/available/etd-20010619-175307.

Full text

Abstract:

<p>Adaptive, or reconfigurable, computing has emerged as a viable computing alternative for computationally intense applications. (We use the terms adaptive and reconfigurable interchangeably). Here, an adaptive computer is a computing system that contains a general purpose processor attached to a programmable logic device such as a field programmable gate array (FPGA). These computing systems combine the flexibility of general purpose processors with the speed of application specific processors. The computer system designer can cater the hardware to a specific application by modifying the con

APA, Harvard, Vancouver, ISO, and other styles

10

Pervaiz, Mehtab M. "Spatio-temporal adaptive algorithm for reacting flows." Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/34994.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Vernersson, Ante. "Adaptive Backprojection : Developing a simple reconstruction algorithm." Thesis, Mittuniversitetet, Avdelningen för elektronikkonstruktion, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-34098.

Full text

Abstract:

This group project aims to investigate the possibility ofconstructing a prototype micro-CT-scanner, hopefullyfurthering the advancement in the field of small CT-scanners,with the ultimate goal to provide a structure useable in anambulance, to scan and send images to the hospital, so thattreatment can commence directly upon arrival.This report deals with the matter of reconstructing the takenimages to construct a three-dimensional model of thescanned object. An algorithm is developed in a mannerunderstandable to those not familiar with traditionalreconstruction techniques, simplifying the under

APA, Harvard, Vancouver, ISO, and other styles

12

Zhao, Shuqi. "Self-Adaptive Algorithm for Warehouse Truck Speed Measurement with Accelerometer." Thesis, KTH, Elektrisk energiomvandling, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166587.

Full text

Abstract:

Warehouse trucks are now a practical equipment for lifting and moving goods in warehouses. The working situation for warehouse trucks is complicated. Spilling of machine oil or liquid product leads to low friction coefficient of the floor. Warehouse floors are normally made of concrete. Smooth concrete floors easily become slippery with liquid on the surface. With several tons of load on the fork, the braking distance is longer. An Anti-lock Braking System(ABS) for the truck control system is needed concerning the safety of the operator and people surrounding the truck. The warehouse truck bra

APA, Harvard, Vancouver, ISO, and other styles

13

Benchoubane, H. "Investigations into a minimal controller synthesis algorithm." Thesis, University of Bristol, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.312265.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Kim, Kieun Mohan Chilukuri K. "Parallel hierarchical adaptive genetic algorithm for genome sequencing." Related Electronic Resource: Current Research at SU : database of SU dissertations, recent titles available full text, 2003. http://wwwlib.umi.com/cr/syr/main.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Srivastava, Ravi K. "An Adaptive Grid Algorithm for Air Quality Modeling." NCSU, 1998. http://www.lib.ncsu.edu/theses/available/etd-19980919-174712.

Full text

Abstract:

<p>SRIVASTAVA, RAVI K. An Adaptive Grid Algorithm for Air Quality Modeling. (Under the direction of Dr. D. Scott McRae.)The physical and chemical processes responsible for air pollution span a wide range of spatial scales. For example, there may be point sources, such as power plants that are characterized by relatively small spatial scales compared to the size of the region that may be impacted by such sources. To obtain accurate distributions of pollutants in an air quality simulation, the pertinent spatial scales can be resolved by varying the physical grid node spacing.A new dynamic adapti

APA, Harvard, Vancouver, ISO, and other styles

16

Lewis, Kemper E. "The adaptive linear programming algorithm : facilitating robust design." Thesis, Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/15949.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Bernier, Lucie 1966. "A genetic algorithm with self-adaptive niche sizing." Thesis, McGill University, 1995. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=22847.

Full text

Abstract:

Optimization of multimodal functions is hard for traditional optimization techniques. Holland's genetic algorithm combined with the concept of niche and speciation already showed success in such difficult problems. Some implementations of this concept exist, but the effective ones all lack flexibility by requiring either previous knowledge about the function to optimize or by imposing some fixed external schedule of exploration. We present an implementation of this concept using minimum spanning trees that is compared with a previous algorithm on random choices of input parameters. Our proposa

APA, Harvard, Vancouver, ISO, and other styles

18

Araujo, Eriko Werbet de Oliveira. "Ajax : an adaptive join algorithm for extreme restrictions." Universidade de Fortaleza, 2008. http://dspace.unifor.br/handle/tede/79970.

Full text

Abstract:

Made available in DSpace on 2019-03-29T23:12:42Z (GMT). No. of bitstreams: 0 Previous issue date: 2008-10-21<br>In a mobile ad hoc network (MANET), the nodes represent mobile computers in which database systems may reside. Such mobile computers (nodes) are free to move arbitrarily. In such an environment, we may have a collection of autonomous, distributed, heterogeneous and mobile databases (denoted Mobile Database Community or MDBC). Thus, each database user (in a mobile host) can access databases belonging to an MDBC through the MANET. Traditional query processing techniques fail to suppo

APA, Harvard, Vancouver, ISO, and other styles

19

Kumar, Kuldeep, and Javier Perez-Ramirez. "Novel BICM HARQ Algorithm Based on Adaptive Modulations." International Foundation for Telemetering, 2011. http://hdl.handle.net/10150/595637.

Full text

Abstract:

ITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevada<br>A novel type-II hybrid automatic repeat request (HARQ) algorithm using adaptive modulations and bit-interleaved coded modulation (BICM) is presented. The algorithm uses different optimized puncturing patterns for different transmissions of the same data packet. The proposed approach exploits mapping diversity through BICM with iterative decoding. The modulation order is changed in each transmission to keep

APA, Harvard, Vancouver, ISO, and other styles

20

Li, Sun, Wang Yinfeng, and Zhang Qishan. "AN ADAPTIVE SIGNAL SEARCH ALGORITHM IN GPS RECEIVER." International Foundation for Telemetering, 1998. http://hdl.handle.net/10150/607349.

Full text

Abstract:

International Telemetering Conference Proceedings / October 26-29, 1998 / Town & Country Resort Hotel and Convention Center, San Diego, California<br>GPS signal fixed dwell and variable dwell time sequential search algorithms are compared with probability of false alarm and detection and searching rate. An adaptive search algorithm is proposed according to different work modes and interference or jam circumstance, which has effectively improved signal acquiring speed and reliability. Mathematical simulation shows its correction and feasible.

APA, Harvard, Vancouver, ISO, and other styles

21

Kumar, Rajendra. "FAST FREQUENCY ACQUISITION VIA ADAPTIVE LEAST SQUARES ALGORITHM." International Foundation for Telemetering, 1986. http://hdl.handle.net/10150/615276.

Full text

Abstract:

International Telemetering Conference Proceedings / October 13-16, 1986 / Riviera Hotel, Las Vegas, Nevada<br>A new least squares algorithm is proposed and investigated for fast frequency and phase acquisition of sinusoids in the presence of noise. This algorithm is a special case of more general adaptive parameter estimation techniques. The advantages of the algorithms are their conceptual simplicity, flexibility and applicability to general situations. For example, the frequency to be acquired can be time varying, and the noise can be non-gaussian, nonstationary and colored. As the proposed

APA, Harvard, Vancouver, ISO, and other styles

22

Quirk, J. J. "An adaptive grid algorithm for computational shock hydrodynamics." Thesis, Boston Spa, U.K. : British Library Document Supply Centre, 1991. http://ethos.bl.uk/OrderDetails.do?did=1&uin=uk.bl.ethos.280913.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

McClintock, Shaunna. "Soft computing : a fuzzy logic controlled genetic algorithm environment." Thesis, University of Ulster, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268579.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Mulgrew, Bernard. "On adaptive filter structure and performance." Thesis, University of Edinburgh, 1987. http://hdl.handle.net/1842/11865.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Sumali, Hartono. "A New Adaptive Array of Vibration Sensors." Diss., Virginia Tech, 1997. http://hdl.handle.net/10919/30642.

Full text

Abstract:

The sensing technique described in this dissertation produces modal coordinates for monitoring and active control of structural vibration. The sensor array is constructed from strain-sensing segments. The segment outputs are transformed into modal coordinates by a sensor gain matrix. An adaptive algorithm for computing the sensor gain matrix with minimal knowledge of the structure's modal properties is proposed. It is shown that the sensor gain matrix is the modal matrix of the segment output correlation matrix. This modal matrix is computed using new algorithms based on Jacobi rotations. The

APA, Harvard, Vancouver, ISO, and other styles

26

Chen, Dan. "An adaptive weighting algorithm for limited dataset verification problems." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B3204897X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Yamazato, Takaya, Iwao Sasase, and Shinsaku Mori. "A New Viterbi Algorithm with Adaptive Path Reduction Method." IEICE, 1993. http://hdl.handle.net/2237/7839.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Asefi, Mahdi. "Classification-Based Adaptive Search Algorithm for Video Motion Estimation." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/2864.

Full text

Abstract:

A video sequence consists of a series of frames. In order to compress the video for efficient storage and transmission, the temporal redundancy among adjacent frames must be exploited. A frame is selected as reference frame and subsequent frames are predicted from the reference frame using a technique known as motion estimation. Real videos contain a mixture of motions with slow and fast contents. Among block matching motion estimation algorithms, the full search algorithm is known for its superiority in the performance over other matching techniques. However, this method is c

APA, Harvard, Vancouver, ISO, and other styles

29

Spearman, William J. "An adaptive algorithm for prioritization in 802.11e wireless networks." Connect to this title online, 2008. http://etd.lib.clemson.edu/documents/1211389333/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Zheng, C. "High performance adaptive MIMO detection : from algorithm to implementation." Thesis, Queen's University Belfast, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.557888.

Full text

Abstract:

Adaptive-Multiple Input Multiple Output (A-MIMO) techniques are regarded as one of the core techniques in 3G/4G wireless communication systems and beyond. One of the key challenges for A- MIMO systems is to retrieve the spatially mixed transmitted symbols at the receiver. However, only a few high performance detection algorithms have been successfully implemented to achieve real-time performance. This thesis concentrates on developing high performance adaptive modulation MIMO detection algorithms and Model Based Design (MBD) techniques that bridge the gap between detection algorithms and effic

APA, Harvard, Vancouver, ISO, and other styles

31

Chan, Chok You. "Stability and robustness of adaptive pole-zero placement algorithm." Thesis, University of Canterbury. Electrical Engineering, 1987. http://hdl.handle.net/10092/6017.

Full text

Abstract:

A computationally efficient pole-zero placement algorithm for explicit adaptive control of discrete-time plants is presented, It is effectively an implicit algorithm in the sense that the controller design stage is trivial. Although the algorithm is restricted to open-loop stable plants, it is applicable to nonminimum phase plants. Results concerning the adaptive control of linear, time-invariant plants having purely deterministic or stochastic disturbances are given. In the deterministic case, it is shown that the adaptive control algorithm ensures that the purely deterministic disturbances

APA, Harvard, Vancouver, ISO, and other styles

32

Chen, Dan, and 陳丹. "An adaptive weighting algorithm for limited dataset verification problems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B3204897X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Nassar, George J. "Adaptive unified thinning algorithm." Thesis, 1996. http://spectrum.library.concordia.ca/6254/1/MM18421.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

"An adaptive parallel genetic algorithm." 2000. http://library.cuhk.edu.hk/record=b5890403.

Full text

Abstract:

Chi Wai Ho, Raymond.<br>Thesis submitted in: December 1999.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2000.<br>Includes bibliographical references (leaves 93-97).<br>Abstracts in English and Chinese.<br>Chapter Chapter 1 --- Introduction --- p.7<br>Chapter 1.1 --- Thesis Outline --- p.10<br>Chapter 1.2 --- Contribution at a Glance --- p.11<br>Chapter Chapter 2 --- Background Concept and Related Work --- p.14<br>Chapter 2.1 --- Genetic Algorithms (GAs) --- p.14<br>Chapter 2.2 --- The Nature of GAs --- p.16<br>Chapter 2.3 --- The Role of Mutation --- p.17<br>Chapter 2.4 --- Th

APA, Harvard, Vancouver, ISO, and other styles

35

Gu, Yu-Jia, and 古祐嘉. "Adaptive K-Nearest Neighbor Algorithm." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/35887089581319797969.

Full text

Abstract:

碩士<br>元智大學<br>資訊管理學系<br>97<br>The K-nearest-neighbor algorithm traditionally predicts the class of a record based on the decision from the K nearest neighbors of the record, for a fixed K value. However, recent studies showed that using different K values for different records could improve the prediction accuracy. This study integrates Fuzzy C-means algorithm to assist determining a proper K value for each record in a local KNN algorithm. Performance results show this method outperforms the traditional KNN in term of prediction accuracy.

APA, Harvard, Vancouver, ISO, and other styles

36

Wang, Te-P., and 王德丕. "Intelligent Adaptive Notch Filtering Algorithm." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/47341183095341938111.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Wu, Chia-Ming, and 吳家鳴. "Adaptive Polygon Predictive Search Algorithm." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/72835802202453533158.

Full text

Abstract:

碩士<br>國立屏東商業技術學院<br>資訊工程系(所)<br>101<br>Motion estimation has been the most key role on video encoding. It is usually applied to block matching algorithm for choosing the best motion vector. The two adjacent images are searched to find the displacement of the same object in the video image. Many fast motion vector block matching algorithms are proposed, and they achieve the efficiency of motion compensation and video compression. In our paper, Adaptive Polygon Predictive Search Algorithm (APPS) that based on ARPS、CS、OctaS and PS is proposed. The experimental results show that the PSNR of the pr

APA, Harvard, Vancouver, ISO, and other styles

38

Lu, Jinn, and 呂晉. "Adaptive Algorithm in Group Testing." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/m37836.

Full text

Abstract:

碩士<br>國立交通大學<br>應用數學系所<br>106<br>In classical group testing, one is given a population N which contains some defective items inside. A group test (pool) is a test on a subset of N. A test is negative if the testing pool contains no defective items and the test is positive if the pool contains at least one defective item but we don’t know which one. Group Testing is a search methodology. The goal is to use less tests to find all defectives. Mainly, to minimize the number of tests in worst case situation. Formally, we let M(d,n) denote the minimum number of tests if |N| = n and d is the number o

APA, Harvard, Vancouver, ISO, and other styles

39

Kuo, Te-Jun, and 郭德潤. "Adaptive Spatial-Temporal De-interlacing Algorithm." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/84252278917659417143.

Full text

Abstract:

碩士<br>國立東華大學<br>電機工程學系<br>94<br>Abstract The interlaced scanning process technique is widely applied in current TV systems to reduce both of the bandwidth requirement and the large area flicker. However, the interlaced scanning produces line flicker and other artificial effects. In order to provide high vision quality image for the display of the multimedia computer and digital television, the de-interlacing algorithm is proposed for converting the interlaced signals to the progressive signals. In this thesis, a simple de-interlacing algorithm which combines the spatial and temporal informat

APA, Harvard, Vancouver, ISO, and other styles

40

Yang, Jie-Sheng, and 楊傑勝. "Adaptive Clustering Algorithm and its Application." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/10713096768065362944.

Full text

Abstract:

碩士<br>國立成功大學<br>資訊工程研究所<br>89<br>Clustering methods have been used extensively in computer vision and pattern recognition. But common use clustering algorithm (like Fuzzy C-Means, Possibilistic C-Means) can''t gain satisfactorily result of every problems. Therefore try at this thesis to hand in an adaptive clustering algorithm, would like to aim at the different data distribution to find out the suitable cluster centers. With the increasing of information, the number of documents also increasing very fast. People don’t want to spend much time to read every document to gain the infor

APA, Harvard, Vancouver, ISO, and other styles

41

Wu, Kuang-Jung, and 吳光榮. "Adaptive algorithm for environmental noise cancellation." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/26688066809698829111.

Full text

Abstract:

碩士<br>國立陽明大學<br>醫學工程研究所<br>90<br>Noise exists around the environment. It has effects on humans’ physiological and psychological functions. The noise decay and cancellation has attracted peoples’ researches and investigations for a long time. The literatures have demonstrated that many algorithms have their cancellation effects on special or low frequency noise. However, most algorithms only have limited function for complex noise, and they are then unsuitable for real applications. The study will investigate different methods and algorithms for the cancellation of different noise, i

APA, Harvard, Vancouver, ISO, and other styles

42

WU, YI-JIE, and 鄔義傑. "Image coding using adaptive blocking algorithm." Thesis, 1989. http://ndltd.ncl.edu.tw/handle/84345360884472152784.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Lin, Chien-Jen, and 林建任. "Adaptive Handover Algorithm in Cellular Network." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/56030491451162608956.

Full text

Abstract:

碩士<br>國立臺灣大學<br>電機工程學研究所<br>90<br>With the mobile subscriber increasing, the cellular system will increase the amount of cells in the same geographic area. That is, the coverage of a cell will be smaller, and the handoff occurs more frequently. If handoff occurs slowly or happens frequently, the quality of service may degenerate below an acceptable level. Furthermore, the voice call may be dropout or the packet data will be lost. In order to reduce the network load due to switching cell, handover algorithms have to be designed to minimize the number of handoffs. Conventional handoff

APA, Harvard, Vancouver, ISO, and other styles

44

Kai-ShiuanShih and 施凱軒. "Intelligent Algorithm Based Adaptive Fuzzy Controllers." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/60731302231609837595.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

"An adaptive distributed Dijkstra shortest path algorithm." Massachusetts Institute of Technology, Laboratory for Information and Decision Systems], 1988. http://hdl.handle.net/1721.1/3061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Zadeh, Seyed Ali Gorji. "An adaptive M-algorithm based convolutional decoder." Thesis, 2005. http://spectrum.library.concordia.ca/8470/1/MR04371.pdf.

Full text

Abstract:

The Viterbi algorithm is one of the most popular convolutional decoders. This algorithm suffers from the high complexity in the decoding of the long constraint length codes. The M-algorithm is a simplified Viterbi algorithm and it is practical for the decoding of the long constraint length codes but it suffers from catastrophic error caused by the correct path loss in the algorithm. In this thesis we propose two different ways of the correct path recovery based on M-algorithm convolutional decoder. The first method is called Ancestor Based Survivor Decision in M-algorithm Convolutional Decoder

APA, Harvard, Vancouver, ISO, and other styles

47

Hsu, Yung-Sheng, and 許永昇. "Adaptive Line Search Algorithm for Packet Classification." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/23376556654576611321.

Full text

Abstract:

碩士<br>國立交通大學<br>電信工程系<br>90<br>Fast packet classification has become a key component to enable additional services in Internet applications. What these services have in common is their requirement for recognizing flows. Basically packet classification can be considered as a process looking for the best matching filter in a filter set. Because of the Internet protocol layers, packet classification is often performed for multiple fields selected from packet headers such as source and destination IP addresses, source and destination port numbers, protocol ID, and even type of service. In general,

APA, Harvard, Vancouver, ISO, and other styles

48

"An adaptive distributed algorithm for path aggregation." 2008. http://library.cuhk.edu.hk/record=b5893539.

Full text

Abstract:

Zhang, Zhenyi.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2008.<br>Includes bibliographical references (leaves 55-[58]).<br>Abstracts in Chinese and English.<br>Chapter 1 --- Introduction --- p.1<br>Chapter 2 --- Problem Formulation --- p.4<br>Chapter 3 --- Examples --- p.7<br>Chapter 3.1 --- Examples of Undirected Graph --- p.7<br>Chapter 3.1.1 --- Example 1: SPF Routing --- p.7<br>Chapter 3.1.2 --- Example 2: rings --- p.7<br>Chapter 3.1.3 --- Example 3: grid --- p.8<br>Chapter 3.1.4 --- Example 4: cube --- p.9<br>Chapter 3.1.5 --- Example 5: random graph X --- p.10<br>Ch

APA, Harvard, Vancouver, ISO, and other styles

49

CHENG, YI-HAN, and 鄭義瀚. "Adaptive Strategy Search Algorithm For Motion Estimation." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/75574169568566845156.

Full text

Abstract:

碩士<br>國立屏東商業技術學院<br>資訊工程系(所)<br>102<br>Searching the suitable Motion Vector (MV) is an important issue in Motion Estimation (ME). In order to solve this problem Block Matching Algorithms (BMA) have been proposed. In BMA, Full Search Algorithm (FSA) is the one of most basic approach. It achieves the best video quality but also results in large amount of computation. Therefore, many fast search algorithms are suggested to decrease search points, such as Three-Step Search Algorithm (TSS), Four-step Search Algorithm (FSS) and Diamond Search Algorithm (DS) . In this paper, Adaptive Strategy Search

APA, Harvard, Vancouver, ISO, and other styles

50

Wu, Tsung-Ju, and 吳宗儒. "Adaptive Bandwidth-Borrowing Algorithm in WiMAX Network." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/45127572554680077149.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>電子工程系<br>97<br>In WiMAX network, service flows with different priorities are defined. The priority of real time traffic is higher than that of non real time traffic. As bandwidth is limited, the resource must be allocated effectively to guarantee the delay time of real time traffic in WiMAX. .Besides this, the proposed algorithm must be able response quickly to prevent the sudden shortage of resource. These problems are worth studying well. In this paper, we propose an Adaptive Bandwidth-Borrowing (ABB) algorithm. This algorithm is upgraded from the traditional bandwidth a

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!