Log in

Relevant bibliographies by topics / Algorithm performance / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Algorithm performance.

Dissertations / Theses on the topic 'Algorithm performance'

Author: Grafiati

Published: 28 June 2021

Last updated: 29 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 'Algorithm performance.'

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

Wang, Lingyun. "Feeder Performance Analysis with Distributed Algorithm." Thesis, Virginia Tech, 2011. http://hdl.handle.net/10919/31949.

Full text

Abstract:

How to evaluate the performance of an electric power distribution system unambiguously and quantitatively is not easy. How to accurately measure the efficiency of it for a whole year, using real time hour-by-hour Locational Marginal Price data, is difficult. How to utilize distributed computing technology to accomplish these tasks with a timely fashion is challenging. This thesis addresses the issues mentioned above, by investigating feeder performance analysis of electric power distribution systems with distributed algorithm. Feeder performance analysis computes a modeled circuitâ s perfor

APA, Harvard, Vancouver, ISO, and other styles

2

Pochet, Juliette. "Evaluation de performance d’une ligne ferroviaire suburbaine partiellement équipée d’un automatisme CBTC." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLC005.

Full text

Abstract:

En zone dense, la croissance actuelle du trafic sur les lignes ferroviaires suburbaines conduit les exploitants à déployer des systèmes de contrôle-commande avancés des trains, tels que les systèmes dits « CBTC » (Communication Based Train Control) jusque-là réservés aux systèmes de métro. Les systèmes CBTC mettent en œuvre un pilotage automatique des trains et permettent une amélioration significative des performances. Par ailleurs, ils peuvent inclure un module de supervision de la ligne en charge de réguler la marche des trains en cas d’aléa, améliorant ainsi la robustesse du trafic. Face a

APA, Harvard, Vancouver, ISO, and other styles

3

Hamrin, Niklas, and Nils Runebjörk. "Examining Sorting Algorithm Performance Under System Load." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-209765.

Full text

Abstract:

In this thesis, we conducted tests in order to determine how system load affected the speed of commonly used algorithms. The difficulty of obtaining these type of results theoretically due to a large number of factors that can affect performance motivated the use of simulation. An implementation was constructed that ran the sorting algorithms Mergesort, Quicksort and Radixsort while the system was put under different levels of stress. This stress was created by generating cache misses using the software stress-ng. The resulting completion times, as well as the cache activity was logged. The re

APA, Harvard, Vancouver, ISO, and other styles

4

Musselman, Roger D. "Robustness a better measure of algorithm performance." Thesis, Monterey, Calif. : Naval Postgraduate School, 2007. http://bosun.nps.edu/uhtbin/hyperion-image.exe/07Sep%5FMusselman.pdf.

Full text

Abstract:

Thesis (M.S. in Operations Research)--Naval Postgraduate School, September 2007.<br>Thesis Advisor(s): Sanchez, Paul J. "September 2007." Description based on title screen as viewed on October 25, 2007. Includes bibliographical references (p. 55-56). Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

5

Chu, Yijing, and 褚轶景. "Resursive local estimation: algorithm, performance and applications." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B49799320.

Full text

Abstract:

Adaptive filters are frequently employed in many applications, such as, system identification, adaptive echo cancellation (AEC), active noise control (ANC), adaptive beamforming, speech signal processing and other related problems, in which the statistic of the underlying signals is either unknown a priori, or slowly-varying. Given the observed signals under study, we shall consider, in this dissertation, the time-varying linear model with Gaussian or contaminated Gaussian (CG) noises. In particular, we focus on recursive local estimation and its applications in linear systems. We base our

APA, Harvard, Vancouver, ISO, and other styles

6

Jonas, Mario Ricardo Edward. "High performance computing and algorithm development: application of dataset development to algorithm parameterization." Thesis, University of the Western Cape, 2006. http://etd.uwc.ac.za/index.php?module=etd&amp.

Full text

Abstract:

A number of technologies exist that captures data from biological systems. In addition, several computational tools, which aim to organize the data resulting from these technologies, have been created. The ability of these tools to organize the information into biologically meaningful results, however, needs to be stringently tested. The research contained herein focuses on data produced by technology that records short Expressed Sequence Tags (EST's).

APA, Harvard, Vancouver, ISO, and other styles

7

Anderson, Roger J. "Characterization of Performance, Robustness, and Behavior Relationships in a Directly Connected Material Handling System." Diss., Virginia Tech, 2006. http://hdl.handle.net/10919/26967.

Full text

Abstract:

In the design of material handling systems with complex and unpredictable dynamics, conventional search and optimization approaches that are based only on performance measures offer little guarantee of robustness. Using evidence from research into complex systems, the use of behavior-based optimization is proposed, which takes advantage of observed relationships between complexity and optimality with respect to both performance and robustness. Based on theoretical complexity measures, particularly algorithmic complexity, several simple complexity measures are created. The relationships betw

APA, Harvard, Vancouver, ISO, and other styles

8

Li, Chuhe. "A sliding window BIRCH algorithm with performance evaluations." Thesis, Mittuniversitetet, Avdelningen för informationssystem och -teknologi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-32397.

Full text

Abstract:

An increasing number of applications covered various fields generate transactional data or other time-stamped data which all belongs to time series data. Time series data mining is a popular topic in the data mining field, it introduces some challenges to improve accuracy and efficiency of algorithms for time series data. Time series data are dynamical, large-scale and high complexity, which makes it difficult to discover patterns among time series data with common methods suitable for static data. One of hierarchical-based clustering methods called BIRCH was proposed and employed for addressi

APA, Harvard, Vancouver, ISO, and other styles

9

Martins, Wellington Santos. "Algorithm performance on a general purpose parallel computer." Thesis, University of East Anglia, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296870.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Balasubramanian, Priya. "Interfacing VHDL performance models to algorithm partitioning tools." Thesis, This resource online, 1996. http://scholar.lib.vt.edu/theses/available/etd-02132009-172459/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Tambouris, Efthimios. "Performance and scalability analysis of parallel systems." Thesis, Brunel University, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.341665.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Kang, Seunghwa. "On the design of architecture-aware algorithms for emerging applications." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/39503.

Full text

Abstract:

This dissertation maps various kernels and applications to a spectrum of programming models and architectures and also presents architecture-aware algorithms for different systems. The kernels and applications discussed in this dissertation have widely varying computational characteristics. For example, we consider both dense numerical computations and sparse graph algorithms. This dissertation also covers emerging applications from image processing, complex network analysis, and computational biology. We map these problems to diverse multicore processors and manycore accelerators. We also us

APA, Harvard, Vancouver, ISO, and other styles

13

Dash, Sajal. "Exploring the Landscape of Big Data Analytics Through Domain-Aware Algorithm Design." Diss., Virginia Tech, 2020. http://hdl.handle.net/10919/99798.

Full text

Abstract:

Experimental and observational data emerging from various scientific domains necessitate fast, accurate, and low-cost analysis of the data. While exploring the landscape of big data analytics, multiple challenges arise from three characteristics of big data: the volume, the variety, and the velocity. High volume and velocity of the data warrant a large amount of storage, memory, and compute power while a large variety of data demands cognition across domains. Addressing domain-intrinsic properties of data can help us analyze the data efficiently through the frugal use of high-performance compu

APA, Harvard, Vancouver, ISO, and other styles

14

Wang, David Tawei. "Modern DRAM memory systems performance analysis and scheduling algorithm /." College Park, Md. : University of Maryland, 2005. http://hdl.handle.net/1903/2432.

Full text

Abstract:

Thesis (Ph. D.) -- University of Maryland, College Park, 2005.<br>Thesis research directed by: Electrical Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO, and other styles

15

Hörmann, Wolfgang. "A Note on the Performance of the "Ahrens Algorithm"." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2001. http://epub.wu.ac.at/1698/1/document.pdf.

Full text

Abstract:

This short note discusses performance bounds for "Ahrens" algorithm, that can generate random variates from continuous distributions with monotonically decreasing density. This rejection algorithms uses constant hat-functions and constant squeezes over many small intervals. The choice of these intervals is important. Ahrens has demonstrated that the equal area rule that uses strips of constant area leads to a very simple algorithm. We present bounds on the rejection constant of this algorithm depending only on the number of intervals. (author's abstract)<br>Series: Preprint Series / Department

APA, Harvard, Vancouver, ISO, and other styles

16

Kostina, Victoria. "Optimization and performance analysis of the V-BLAST algorithm." Thesis, University of Ottawa (Canada), 2006. http://hdl.handle.net/10393/27382.

Full text

Abstract:

Complexity-performance tradeoff in different implementations of the V-BLAST algorithm is discussed. Low-complexity alternatives to the optimal ordering procedure, such as ordering at 1st step, adaptive power allocation and pre-set non-uniform power allocation are proposed. A unified analytical framework for the optimum power allocation in the V-BLAST algorithm is presented. Comparative performance analysis of the optimum power allocation based on various optimization criteria (average and instantaneous block and total error rates) is given. Uniqueness of the optimum power allocation is proven

APA, Harvard, Vancouver, ISO, and other styles

17

Song, Shuo. "Performance analysis and algorithm design for distributed transmit beamforming." Thesis, University of Edinburgh, 2011. http://hdl.handle.net/1842/5724.

Full text

Abstract:

Wireless sensor networks has been one of the major research topics in recent years because of its great potential for a wide range of applications. In some application scenarios, sensor nodes intend to report the sensing data to a far-field destination, which cannot be realized by traditional transmission techniques. Due to the energy limitations and the hardware constraints of sensor nodes, distributed transmit beamforming is considered as an attractive candidate for long-range communications in such scenarios as it can reduce energy requirement of each sensor node and extend the communicatio

APA, Harvard, Vancouver, ISO, and other styles

18

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

19

Gerlach, Adam R. "Performance Enhancements of the Spin-Image Pose Estimation Algorithm." University of Cincinnati / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1267730727.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Arif, Annatoma Arif. "BLURRED FINGERPRINT IMAGE ENHANCEMENT: ALGORITHM ANALYSIS AND PERFORMANCE EVALUATION." Miami University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=miami1473428137332997.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Almerström, Przybyl Simon. "A Trade-based Inference Algorithm for Counterfactual Performance Estimation." Thesis, KTH, Matematisk statistik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254453.

Full text

Abstract:

A methodology for increasing the success rate in debt collection by matching individual call center agents with optimal debtors is developed. This methodology, called the trade algorithm, consists of the following steps. The trade algorithm first identifies groups of debtors for which agent performance varies. Based on these diﬀerences in performance, agents are put into clusters. An optimal call allocation for the clusters is then decided. Two methods to estimate the performance of an optimal call allocation are suggested. These methods are combined with Monte Carlo cross-validation and an al

APA, Harvard, Vancouver, ISO, and other styles

22

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

23

Olsson, Victor, and Viktor Eklund. "CPU Performance Evaluation for 2D Voronoi Tessellation." Thesis, Blekinge Tekniska Högskola, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18259.

Full text

Abstract:

Voronoi tessellation can be used within a couple of different fields. Some of these fields include healthcare, construction and urban planning. Since Voronoi tessellations are used in multiple fields, it is motivated to know the strengths and weaknesses of the algorithms used to generate them, in terms of their efficiency. The objectives of this thesis are to compare two CPU algorithm implementations for Voronoi tessellation in regards to execution time and see which of the two is the most efficient. The algorithms compared are The Bowyer-Watson algorithm and Fortunes algorithm. The Fortunes a

APA, Harvard, Vancouver, ISO, and other styles

24

Xu, Lin. "Performance modelling and automated algorithm design for NP-hard problems." Thesis, University of British Columbia, 2014. http://hdl.handle.net/2429/51175.

Full text

Abstract:

In practical applications, some important classes of problems are NP-complete. Although no worst-case polynomial time algorithm exists for solving them, state-of-the-art algorithms can solve very large problem instances quickly, and algorithm performance varies significantly across instances. In addition, such algorithms are rather complex and have largely resisted theoretical average-case analysis. Empirical studies are often the only practical means for understanding algorithms’ behavior and for comparing their performance. My thesis focuses on two types of research questions. On the science

APA, Harvard, Vancouver, ISO, and other styles

25

Hyyrynen, Fredrik, and Marcus Lignercrona. "A performance study of anevolutionary algorithm for twopoint stock forecasting." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-208376.

Full text

Abstract:

This study was conducted to conclude whether or not it was possible to accurately predict stock behavior by analyzing general patterns in historical stock data. This was done by creating an evolutionary algorithm that learned and weighted possible outcomes by studying the behaviour of the Nasdaq stock market between 2000 and 2016 and using the result from the training to make predictions. The result of testing with varied parameters concluded that clear patterns could not reliably be established with the suggested method as small adjustments to the measuring dates yielded wildly different resu

APA, Harvard, Vancouver, ISO, and other styles

26

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Zhou, Yufeng. "Performance Evaluation of a Weighted Clustering Algorithm in NSPS Scenarios." Thesis, KTH, Reglerteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-140427.

Full text

Abstract:

In national security and public safety (NSPS) scenarios, the concept of device-to-device (D2D) clustering allows user equipment (UEs) to dynamically form clusters and thereby allows for local communication with partial or no cellular network assistance. We propose and evaluate a clustering approach to solve this problem in this thesis report. One of the key components of clustering is the selection of so called cluster head (CH) nodes that are responsible for the formation of clusters and act as a synchronization and radio resource management information source. In this thesis work we propose

APA, Harvard, Vancouver, ISO, and other styles

28

Malladi, Subrahmanya Sastry Venkata. "Modeling and Algorithm Performance For Seismic Surface Wave Velocity Estimation." University of Akron / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=akron1194630399.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Uren, PJ. "Investigation of Distributed and Parallel Performance of a Genetic Algorithm." Thesis, Honours thesis, University of Tasmania, 2004. https://eprints.utas.edu.au/101/1/Philip_Uren_Thesis_Final.pdf.

Full text

Abstract:

Genetic algorithms, a stochastic evolutionary computing technique, have demonstrated a capacity for robust, efficient problem solving through highly parallel search space exploration. This work demonstrates how an improvement in performance and efficiency over the traditional serial approach can be achieved by exploiting this highly parallel nature to produce parallel genetic algorithms. Furthermore, it is shown that by incorporating domain specific knowledge into a genetic algorithm near optimal solutions can be located in minimal time.

APA, Harvard, Vancouver, ISO, and other styles

30

Mackey, Carol Ann. "A performance-driven fuzzy algorithm for placement of macro cells." Thesis, The University of Arizona, 1995. http://hdl.handle.net/10150/291564.

Full text

Abstract:

Macro cell placement is an integral part of VLSI design. Existing placement techniques do not use a realistic human-like intuitive process for making decisions and therefore, lack the ability to make decisions based on several factors at once. In this research a quad-partitioning algorithm with a tabu search and a fuzzy cost function is used for macro cell placement. This approach partitions the design into small pieces that can be easily placed. The algorithm is based on a method which tries to reduce the path lengths and reduce the number of edges which cross out of a partition. The fuzzy co

APA, Harvard, Vancouver, ISO, and other styles

31

Comte, Céline. "Resource management in computer clusters : algorithm design and performance analysis." Thesis, Institut polytechnique de Paris, 2019. http://www.theses.fr/2019SACLT034/document.

Full text

Abstract:

La demande croissante pour les services de cloud computing encourage les opérateurs à optimiser l’utilisation des ressources dans les grappes d’ordinateurs. Cela motive le développement de nouvelles technologies qui rendent plus flexible la gestion des ressources. Cependant, exploiter cette flexibilité pour réduire le nombre d’ordinateurs nécessite aussi des algorithmes de gestion des ressources efficaces et dont la performance est prédictible sous une demande stochastique. Dans cette thèse, nous concevons et analysons de tels algorithmes en utilisant le formalisme de la théorie des files d’at

APA, Harvard, Vancouver, ISO, and other styles

32

Comte, Céline. "Resource management in computer clusters : algorithm design and performance analysis." Electronic Thesis or Diss., Institut polytechnique de Paris, 2019. http://www.theses.fr/2019IPPAT001.

Full text

Abstract:

La demande croissante pour les services de cloud computing encourage les opérateurs à optimiser l’utilisation des ressources dans les grappes d’ordinateurs. Cela motive le développement de nouvelles technologies qui rendent plus flexible la gestion des ressources. Cependant, exploiter cette flexibilité pour réduire le nombre d’ordinateurs nécessite aussi des algorithmes de gestion des ressources efficaces et dont la performance est prédictible sous une demande stochastique. Dans cette thèse, nous concevons et analysons de tels algorithmes en utilisant le formalisme de la théorie des files d’at

APA, Harvard, Vancouver, ISO, and other styles

33

Farghally, Mohammed Fawzi Seddik. "Visualizing Algorithm Analysis Topics." Diss., Virginia Tech, 2016. http://hdl.handle.net/10919/73539.

Full text

Abstract:

Data Structures and Algorithms (DSA) courses are critical for any computer science curriculum. DSA courses emphasize concepts related to procedural dynamics and Algorithm Analysis (AA). These concepts are hard for students to grasp when conveyed using traditional textbook material relying on text and static images. Algorithm Visualizations (AVs) emerged as a technique for conveying DSA concepts using interactive visual representations. Historically, AVs have dealt with portraying algorithm dynamics, and the AV developer community has decades of successful experience with this. But there exist

APA, Harvard, Vancouver, ISO, and other styles

34

Vidas, Dario. "Performance Evaluation of Stereo Reconstruction Algorithms on NIR Images." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-191148.

Full text

Abstract:

Stereo vision is one of the most active research areas in computer vision. While hundreds of stereo reconstruction algorithms have been developed, little work has been done on the evaluation of such algorithms and almost none on evaluation on Near-Infrared (NIR) images. Of almost a hundred examined, we selected a set of 15 stereo algorithms, mostly with real-time performance, which were then categorized and evaluated on several NIR image datasets, including single stereo pair and stream datasets. The accuracy and run time of each algorithm are measured and compared, giving an insight into whic

APA, Harvard, Vancouver, ISO, and other styles

35

Dornelles, Edelweis Helena Ache Garcez. "Análise da performance do algoritmo d." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 1993. http://hdl.handle.net/10183/26546.

Full text

Abstract:

A geração de testes para circuitos combinacionais com fan-outs recovergentes é um problema NP-completo. Com o rápido crescimento da complexidade dos circuitos fabricados, a geração de testes passou a ser um sério problema para a indústria de circuitos integrados. Muitos algoritmos de ATPG (Automatic Test Pattern Generation) baseados no algoritmo D, usam heurísticas para guiar o processo de tomada de decisão na propagação n e na justificação das constantes de forma a aumentar sua eficiencia. Existem heurísticas baseadas em medidas funcionais, estruturais e probabilísticas. Estas medidas são nor

APA, Harvard, Vancouver, ISO, and other styles

36

Qu, Shaohong. "High Performance Algorithms for Structural Analysis of Grid Stiffened Panels." Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/36990.

Full text

Abstract:

In this research, we apply modern high performance computing techniques to solve an engineering problem, structural analysis of grid stiffened panels. An existing engineering code, SPANDO, is studied and modified to execute more efficiently on high performance workstations and parallel computers. Two new SPANDO packages, a modified sequential SPANDO and parallel SPANDO, are developed. In developing the new sequential SPANDO, we use two existing high performance numerical packages: LAPACK and ARPACK to solve our linear algebra problems. Also, a new block-oriented algorithm for computin

APA, Harvard, Vancouver, ISO, and other styles

37

Arslan, Omer Cagri. "Implementation And Performance Evaluation Of A Three Antenna Direction Finding System." Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/2/12611215/index.pdf.

Full text

Abstract:

State of the art direction finding (DF) systems usually have several antennas in order to increase accuracy and robustness to certain factors. In this thesis, a three antenna DF system is built and evaluated. While more antennas give better DF performance, a three antenna system is useful for system simplicity and many of the problems in DF systems can be observed and evaluated easily. This system can be used for both azimuth and elevation direction of arrival (DOA) estimation. The system is composed of three monopole antennas, an RF front end, A/D converters and digital signal processing (DSP

APA, Harvard, Vancouver, ISO, and other styles

38

Lavesson, Niklas. "Evaluation of classifier performance and the impact of learning algorithm parameters." Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik och datavetenskap, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4578.

Full text

Abstract:

Much research has been done in the fields of classifier performance evaluation and optimization. This work summarizes this research and tries to answer the question if algorithm parameter tuning has more impact on performance than the choice of algorithm. An alternative way of evaluation; a measure function is also demonstrated. This type of evaluation is compared with one of the most accepted methods; the cross-validation test. Experiments, described in this work, show that parameter tuning often has more impact on performance than the actual choice of algorithm and that the measure function

APA, Harvard, Vancouver, ISO, and other styles

39

Fleischer, Mark Alan. "Assessing the performance of the simulated annealing algorithm using information theory." Case Western Reserve University School of Graduate Studies / OhioLINK, 1994. http://rave.ohiolink.edu/etdc/view?acc_num=case1057677595.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Sankaran, Sundar G. "On Ways to Improve Adaptive Filter Performance." Diss., Virginia Tech, 1999. http://hdl.handle.net/10919/30198.

Full text

Abstract:

Adaptive filtering techniques are used in a wide range of applications, including echo cancellation, adaptive equalization, adaptive noise cancellation, and adaptive beamforming. The performance of an adaptive filtering algorithm is evaluated based on its convergence rate, misadjustment, computational requirements, and numerical robustness. We attempt to improve the performance by developing new adaptation algorithms and by using "unconventional" structures for adaptive filters. Part I of this dissertation presents a new adaptation algorithm, which we have termed the Normalized LMS algorith

APA, Harvard, Vancouver, ISO, and other styles

41

Kilic, Varlik. "Performance Improvement Of A 3d Reconstruction Algorithm Using Single Camera Images." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606259/index.pdf.

Full text

Abstract:

In this study, it is aimed to improve a set of image processing techniques used in a previously developed method for reconstructing 3D parameters of a secondary passive target using single camera images. This 3D reconstruction method was developed and implemented on a setup consisting of a digital camera, a computer, and a positioning unit. Some automatic target recognition techniques were also included in the method. The passive secondary target used is a circle with two internal spots. In order to achieve a real time target detection, the existing binarization, edge detection, and ellipse

APA, Harvard, Vancouver, ISO, and other styles

42

Hung, Ling-Chin, and 洪凌芹. "Evolving Music Performance using Genetic Algorithm." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/02975768677446286833.

Full text

Abstract:

碩士<br>義守大學<br>資訊工程學系碩士班<br>96<br>An original MIDI (Musical Instrument Digital Interface) piece can only perform even and boring sound. In this thesis, we design the performance profile through hierarchical pulse sets by using Genetic Algorithm (GA) to improve music interpretation. We usually emphasize the key words during talking in order to convey complete idea clearly. It is the same in music piece expression. The piece is divided into many phrases, and we emphasize some of the phrases by extending specific notes. Genetic algorithm mainly mimics the natural selection characteristic of genes

APA, Harvard, Vancouver, ISO, and other styles

43

Liu, Hwei-Yu, and 劉蕙瑜. "Characterizing Cooperate Financial Performance with Char Algorithm." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/24184849283526756842.

Full text

Abstract:

碩士<br>國立中央大學<br>工業管理研究所<br>93<br>In the perspective of investments, they desire to use the less financial variables to anticipate the most performance information. Every human being is increasingly faced with unmanageable amounts of financial data; hence, data mining or knowledge discovery apparently affects all of us. In this study of mining performance of company, we attempt to summarize the stronger characteristic rules of fundamental analysis using 81 financial statement variables. To address this problem, we proposed an effective method, a Char Algorithm, to automatically produce characte

APA, Harvard, Vancouver, ISO, and other styles

44

白聖秋. "Performance improvment of dynamic tree splitting algorithm." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/66783640231047075394.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Wang, Yi Han, and 王怡涵. "An efficient algorithm for performance-driven clustering." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/37409266559851271912.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Lin, Whe Dar, and 林慧達. "A Performance Driven Placement Algorithm For FPGAs." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/64593975287687098014.

Full text

Abstract:

碩士<br>國立清華大學<br>資訊科學學系<br>81<br>In this paper, we propose a performance driven placement method for FPGAs. The proposed system first assigns the levels of the network using as-soon-as-possible method and finds the relative locations by a bipartite weighted matching algorithm. It then searches for the network shape to fit into the given FPGA architecture. Lastly, a bipartite-weighted-matching is performed again to assign cells into the new shape. Our method is able to produce a shorter criti

APA, Harvard, Vancouver, ISO, and other styles

47

Antelman, Kristin, Nisa Bakkalbasi, David Goodman, Chawki Hajjem, and Stevan Harnad. "Evaluation of Algorithm Performance on Identifying OA." 2005. http://hdl.handle.net/10150/105417.

Full text

Abstract:

This is a second signal-detection analysis of the accuracy of a robot in detecting open access (OA) articles (by checking by hand how many of the articles the robot tagged OA were really OA, and vice versa). We found that the robot significantly overcodes for OA. In our Biology sample, 40% of identified OA was in fact OA. In our Sociology sample, only 18% of identified OA was in fact OA. Missed OA was lower: 12% in Biology and 14% in Sociology. The sources of the error are impossible to determine from the present data, since the algorithm did not capture URL's for documents ide

APA, Harvard, Vancouver, ISO, and other styles

48

Cheng, Kuang-Hung, and 鄭光宏. "Improving Wafer Retesting Performance Using Greedy Algorithm." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/3rn6n8.

Full text

Abstract:

碩士<br>國立中興大學<br>資訊科學與工程學系所<br>107<br>The technological advancements on integrated circuits (IC) drive the increasing of wafer size as well as the number of dies that can be put in a wafer. As a result, the costs of testing and retesting wafers also increase. Wafer test is divided into probing and re-probing phases. Wafer probing phase is for checking the quality of each die in the wafer. Wafer re-probing phase only retests the failed dies discovered in the probing phase. To do chip probing on a wafer, the probes on the probe card need to make contact with wafer for electrical testing (In-Circu

APA, Harvard, Vancouver, ISO, and other styles

49

Peng, Chun-Fang, and 彭俊方. "A Proxy Cache Replacement Algorithm: A Performance Evaluation." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/06027818361582232673.

Full text

Abstract:

碩士<br>國立清華大學<br>資訊工程學系<br>90<br>The World-Wide Web traffic keeps on growing rapidly. The web proxy is common solution to reduce the web traffic and the policy of the cache replacement plays a key factor to the performance of a web proxy. In the past, cache architecture has been extensively studied in many fields and several cache replacement algorithms for the web proxy have been developed. In the cache of web proxy, there are some phenomena that differ from those of other applications, such as computer architecture and operating systems. There are four different characteristics (1) size dist

APA, Harvard, Vancouver, ISO, and other styles

50

WU, WAN-JU, and 吳宛儒. "Performance Optimization of Retinex–Based Image Enhancement Algorithm." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/b8kkxn.

Full text

Abstract:

碩士<br>國立中正大學<br>電機工程研究所<br>105<br>Image enhancement plays an important role in digital image processing and has been applied to fields of science and engineering. Among all of the image enhancement algorithms, Retinex-based algorithms are considered most effective in maintaining details of images. Despite the advantages, Retinex-based algorithms are generally more complex and consume considerably more time to maintain the balance between image detail and ambient illumination. And like most image enhancement algorithms, conventional Retinex-based algorithms are prone to over-enhancement when

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!