Дисертації з теми "080201 Analysis of Algorithms and Complexity"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-39 дисертацій для дослідження на тему "080201 Analysis of Algorithms and Complexity".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Richey, Michael Bruce. "Combinatorial optimization on series-parallel graphs : algorithms and complexity." Diss., Georgia Institute of Technology, 1985. http://hdl.handle.net/1853/24542.
Повний текст джерелаNordin, Henrik, and Kevin Jouper. "Performance analysis of multithreaded sorting algorithms." Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-10404.
Повний текст джерелаCastura, Jeff. "Performance analysis and optimization of reduced complexity Low Density Parity Check decoding algorithms." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0017/MQ53426.pdf.
Повний текст джерелаPowell, David Richard 1973. "Algorithms for sequence alignment." Monash University, School of Computer Science and Software Engineering, 2001. http://arrow.monash.edu.au/hdl/1959.1/8051.
Повний текст джерелаPhilips, Petra Camilla, and petra philips@gmail com. "Data-Dependent Analysis of Learning Algorithms." The Australian National University. Research School of Information Sciences and Engineering, 2005. http://thesis.anu.edu.au./public/adt-ANU20050901.204523.
Повний текст джерелаHo, Lester Tse Wee. "Self-organising algorithms for fourth generation wireless networks and its analysis using complexity metrics." Thesis, Queen Mary, University of London, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.407388.
Повний текст джерелаKenny, Robert. "Orbit complexity and computable Markov partitions." University of Western Australia. School of Mathematics and Statistics, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0231.
Повний текст джерелаWei, Ke. "Efficient algorithms for compressed sensing and matrix completion." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:0e2e72fb-dd0c-457b-a0a5-f91c5212f5f5.
Повний текст джерелаStarrett, Dean. "Optimal Alignment of Multiple Sequence Alignments." Diss., The University of Arizona, 2008. http://hdl.handle.net/10150/194840.
Повний текст джерелаOsbild, Ralf Verfasser], та Kurt [Akademischer Betreuer] [Mehlhorn. "General analysis tool box for controlled perturbation algorithms and complexity and computation of Θ-guarded regions / Ralf Osbild. Betreuer: Kurt Mehlhorn". Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2013. http://d-nb.info/1053634994/34.
Повний текст джерелаSaročka, Gediminas. "Rūšiavimo algoritmų vizualizavimas ir sudėtingumo analizė." Bachelor's thesis, Lithuanian Academic Libraries Network (LABT), 2012. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2012~D_20120702_130011-99489.
Повний текст джерелаThere is a lot of complexity analysis of sorting algorithms can be found without problems, so the main idea of this work was to create a visualization of sorting algorithms. This work was created three simple sorting algorithms (insertion sort, bubble sort and selection sort), and two high-speed sorting algorithms (Shell sort and merge sort) visualization. This program is capable of calculating sorting time of sorting algorithm for further sorting algorithm complexity analysis.
Singh, Manjeet. "Mathematical Models, Heuristics and Algorithms for Efficient Analysis and Performance Evaluation of Job Shop Scheduling Systems Using Max-Plus Algebraic Techniques." Ohio University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1386087325.
Повний текст джерелаCunial, Fabio. "Analysis of the subsequence composition of biosequences." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/44716.
Повний текст джерелаRiegel, Ryan Nelson. "Generalized N-body problems: a framework for scalable computation." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/50269.
Повний текст джерелаNirenstein, Shaun. "Fast and Accurate Visibility Preprocessing." Thesis, University of Cape Town, 2003. http://pubs.cs.uct.ac.za/archive/00000101/.
Повний текст джерелаNataša, Dragnić. ""Konstrukcija i analiza klaster algoritma sa primenom u definisanju bihejvioralnih faktora rizika u populaciji odraslog stanovništva Srbije"." Phd thesis, Univerzitet u Novom Sadu, Doktorske disertacije iz interdisciplinarne odnosno multidisciplinarne oblasti na Univerzitetu u Novom Sadu, 2016. https://www.cris.uns.ac.rs/record.jsf?recordId=99629&source=NDLTD&language=en.
Повний текст джерелаThe cluster analysis has a long history and alarge number of clustering techniques havebeen developed in many areas, however,significant challenges still remain. In thisthesis we have provided a introduction tononsmooth optimization approach to clusteringwith reference to clustering large datasets.Nevertheless, these optimization clusteringalgorithms work much better when a datasetcontains only vectors with continuous features.One of the main challenges is clustering of largedatasets with categorical and mixed (numericaland categorical) data. Clustering deals with alarge number of instances (objects) and a largenumber of dimensions (variables) can beproblematic because of time complexity. One ofthe ways to solve this problem is by reducingthe number of instances, without the loss ofinformation.The first aim of this thesis was to comparethe results of cluster algorithms on the wholedataset and on simple random samples withcategorical and mixed data, in terms of validity,for different number of clusters and fordifferent sample sizes. There were nosignificant differences (p>0.05) between theobtained results on the samples of the size of0.03m,0.05m,0.1m,0.3m (where m is the size ofthe dataset) and the whole dataset.The second aim of this thesis was todevelop an efficient clustering procedure forlarge datasets with categorical and mixed(numeric and categorical) values. The proposedprocedure consists of the following steps: 1.clustering on simple random samples of a givencardinality; 2. finding the best cluster solutionon a sample (by appropriate validity measure);3. using cluster centers from this sample forclustering of the remaining data.The third aim of this thesis was toexamine clustering of four lifestyle risk factorsand to examine the variation across differentsocio-demographic groups in a Serbian adultpopulation. Cluster analysis was carried out ona large representative sample of Serbian adultsaged 20 and over. We identified fivehomogenous health behaviour clusters withspecific combination of risk factors: 'No RiskBehaviours', 'Drinkers with Risk Behaviours','Unhealthy diet with Risk Behaviours','Smoking'. Results of multinomial logisticregression indicated that single adults, lesseducated, with low socio-economic status andliving in the region of Vojvodina are most likelyto be a part of the clusters with a high-riskprofile.
Taeihagh, Araz. "A novel approach for the development of policies for socio-technical systems." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:0183f800-51bf-4e4d-abba-cd91b7bf48f0.
Повний текст джерелаFujdiak, Radek. "Analýza a optimalizace datové komunikace pro telemetrické systémy v energetice." Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2017. http://www.nusl.cz/ntk/nusl-358408.
Повний текст джерелаEvans, Patricia Anne. "Algorithms and complexity for annotated sequence analysis." Thesis, 1999. https://dspace.library.uvic.ca//handle/1828/8864.
Повний текст джерелаGraduate
Sani, Habiba M., Ci Lei, and Daniel Neagu. "Computational complexity analysis of decision tree algorithms." 2018. http://hdl.handle.net/10454/16762.
Повний текст джерелаDecision tree is a simple but powerful learning technique that is considered as one of the famous learning algorithms that have been successfully used in practice for various classification tasks. They have the advantage of producing a comprehensible classification model with satisfactory accuracy levels in several application domains. In recent years, the volume of data available for learning is dramatically increasing. As a result, many application domains are faced with a large amount of data thereby posing a major bottleneck on the computability of learning techniques. There are different implementations of the decision tree using different techniques. In this paper, we theoretically and experimentally study and compare the computational power of the most common classical top-down decision tree algorithms (C4.5 and CART). This work can serve as part of review work to analyse the computational complexity of the existing decision tree classifier algorithm to gain understanding of the operational steps with the aim of optimizing the learning algorithm for large datasets.
Bernstein, Daniel S. "Complexity analysis and optimal algorithms for decentralized decision making." 2005. https://scholarworks.umass.edu/dissertations/AAI3193879.
Повний текст джерелаPourhassan, Mojgan. "Parameterised complexity analysis of evolutionary algorithms for combinatorial optimization problems." Thesis, 2017. http://hdl.handle.net/2440/109799.
Повний текст джерелаThesis (Ph.D.) -- University of Adelaide, School of Computer Science, 2017.
Chin, Kien-Weh, and 陳建文. "Algorithms and Complexity Analysis of the Symmetry Number Problem for Graphs." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/04362411441823877826.
Повний текст джерела國立臺灣大學
電機工程學系研究所
86
Graphs are known to be useful for modeling various scientific/engineering prob lems in the real world. Because of the popularity of graphs, graph drawing has emerged as a research topic of great importance in graph theory. Although a l ot of graph drawing algorithms have been proposed, few of them explicitly targ ets for graph drawings with high degree of symmetry. In this thesis, we define the symmetry number to measure the degree of symmetry of graphs, and discuss the complexity of deciding the symmetry number of graphs. We also propose a po lynomial time algorithm to decide the maximum symmetric subtree of a given tre e.
Philips, Petra. "Data-Dependent Analysis of Learning Algorithms." Phd thesis, 2005. http://hdl.handle.net/1885/47998.
Повний текст джерела"Performance Analysis of Low-Complexity Resource-Allocation Algorithms in Stochastic Networks Using Fluid Models." Doctoral diss., 2015. http://hdl.handle.net/2286/R.I.36414.
Повний текст джерелаDissertation/Thesis
Doctoral Dissertation Electrical Engineering 2015
Vasudevan, Shobha. "High level static analysis of system descriptions for taming verification complexity." 2007. http://hdl.handle.net/2152/15978.
Повний текст джерелаZhang, Rui. "Model selection techniques for kernel-based regression analysis using information complexity measure and genetic algorithms." 2007. http://etd.utk.edu/2007/ZhangRui.pdf.
Повний текст джерелаHsu, Chao-Yuan, and 許兆元. "ICI Mitigation for High-mobility SISO/MIMO OFDM Systems: Low-complexity Algorithms and Performance Analysis." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/41881546213151002873.
Повний текст джерела國立交通大學
電信工程系所
97
In orthogonal frequency-division multiplexing (OFDM) systems, it is generally assumed that the channel response is static in an OFDM symbol period. However, the assumption does not hold in high-mobility environments. As a result, intercarrier interference (ICI) is induced and the system performance is degraded. A simple remedy for this problem is the application of the zero-forcing (ZF) and minimum mean square error (MMSE) equalizers. Unfortunately, the direct ZF method requires the inversion of an NxN ICI matrix, where N is the number of subcarriers. When N is large, the computational complexity can become prohibitively high. As for the direct MMSE method, in addition to an NxN matrix inverse, it requires an extra NxN matrix multiplication, making the required computational complexity higher compared to the direct ZF method. In this dissertation, we first propose a low-complexity ZF method to solve the problem in single-input-single-output (SISO) OFDM systems. The main idea is to explore the special structure inherent in the ICI matrix and to apply Newton's iteration for matrix inversion. With our formulation, fast Fourier transforms (FFTs) can be used in the iterative process, reducing the complexity from O(N^3) to O(Nlog_2 N) . Also, the required number of the iteration is typically one or two. We also analyze the convergence behavior of the proposed method and derive the theoretical output signal-to-interference-noise-ratio (SINR). For the MMSE method, we first reformulate the MMSE solution in a way that the extra matrix multiplication can be avoided. Similar to the ZF method, we then exploit the structure of the ICI matrix and apply Newton's iteration to reduce the complexity of the matrix inversion. For a multiple-input-multiple-output (MIMO) OFDM system, the required complexity of the ZF and MMSE methods becomes more intractable. We then manage to extend the proposed ZF and MMSE methods for SISO-OFDM systems to MIMO-OFDM systems. It turns out that the computational complexity can be reduced even more significantly. Simulation results show that the performance of the proposed methods is almost as good as that of the direct ZF and MMSE methods, while the required computational complexity is reduced dramatically. Finally, we explore the application of the proposed methods in mobility-induced ICI mitigation for OFDM multiple access (OFDMA) systems, and in carrier frequency offset (CFO) induced ICI mitigation for OFDMA uplink systems. As that in OFDM systems, the proposed methods can reduce the required computational complexity, effectively.
(8072036), Ahmed I. Al Herz. "APPROXIMATION ALGORITHMS FOR MAXIMUM VERTEX-WEIGHTED MATCHING." Thesis, 2019.
Знайти повний текст джерелаWoolway, Matthew. "Computational approaches in compressed sensing." Thesis, 2014. http://hdl.handle.net/10539/15334.
Повний текст джерелаThis thesis aims to provide a summary on computational approaches to solving the Compressed Sensing problem. The theoretical problem of solving systems of linear equations has long been investigated in academic literature. A relatively new field, Compressed Sensing is an application of such a problem. Specifically, with the ability to change the way in which we obtain and process signals. Under the assumption of sparse signals, Compressed Sensing is able to recover signals sampled at a rate much lower than that of the current Shannon/Nyquist sampling rate. The primary goal of this thesis, is to describe major algorithms currently used in the Compressed Sensing problem. This is done as a means to provide the reader with sufficient up to date knowledge on current approaches as well as their means of implementation, on central processing units (CPUs) and graphical processing units (GPUs), when considering computational concerns such as computational time, storage requirements and parallelisability.
Sauer, Paul Van der Merwe. "The complexity of unavoidable word patterns." Thesis, 2019. http://hdl.handle.net/10500/27343.
Повний текст джерелаThe avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. The word α over a finite set A is said to be unavoidable for an infinite set B+ of nonempty words over a finite set B if, for all but finitely many elements w of B+, there exists a semigroup morphism φ ∶ A+ → B+ such that φ(α) is a factor of w. In this treatise, we start by presenting a historical background of results that are related to unavoidability. We present and discuss the most important theorems surrounding unavoidability in detail. We present various complexity-related properties of unavoidable words. For words that are unavoidable, we provide a constructive upper bound to the lengths of words that avoid them. In particular, for a pattern α of length n over an alphabet of size r, we give a concrete function N(n, r) such that no word of length N(n, r) over the alphabet of size r avoids α. A natural subsequent question is how many unavoidable words there are. We show that the fraction of words that are unavoidable drops exponentially fast in the length of the word. This allows us to calculate an upper bound on the number of unavoidable patterns for any given finite alphabet. Subsequently, we investigate computational aspects of unavoidable words. In particular, we exhibit concrete algorithms for determining whether a word is unavoidable. We also prove results on the computational complexity of the problem of determining whether a given word is unavoidable. Specifically, the NP-completeness of the aforementioned problem is established.
Decision Sciences
D. Phil. (Operations Research)
Medina, Raúl Ezequiel. "Optimización de dominios de Planning." Bachelor's thesis, 2016. http://hdl.handle.net/11086/3216.
Повний текст джерелаEn este trabajo se describe una técnica de optimización de dominios de Planning. Primero se presenta una introducción cerca de la inteligencia artificial en general. Luego se aborda el problema de planning revisando los momentos históricos más importantes hasta llegar al estado del arte. También se introduce el lenguaje PDDL para poder presentar nuevos dominios que se implementaron. Luego se presenta la técnica de optimización propuesta, la cual incluye el algoritmo de Split y Unsplit. Con el fin de poder estudiar el rendimiento de la técnica de optimización propuesta, se realizan pruebas de rendimiento sobre los dominios presentados y un dominio clásico. Por último se estudian los resultados obtenidos para poder dar una conclusión sobre la técnica en general.
This work explain an optimization technique for planning domains. First comes an introduction about artificial intelligence in general. Then describes the planning problem, the most important historical moments are reviewd until the state of the art. After that, the language PDDL is introduced, to understand the new domains implemented. Then the Split and Unsplit algorithms are presented. Finally after running tests, the results and conclusion are shown.
(9741149), Lintao Ye. "Algorithmic and Graph-Theoretic Approaches for Optimal Sensor Selection in Large-Scale Systems." Thesis, 2020.
Знайти повний текст джерелаTilak, Omkar Jayant. "Decentralized and Partially Decentralized Multi-Agent Reinforcement Learning." 2013. http://hdl.handle.net/1805/3462.
Повний текст джерелаMulti-agent systems consist of multiple agents that interact and coordinate with each other to work towards to certain goal. Multi-agent systems naturally arise in a variety of domains such as robotics, telecommunications, and economics. The dynamic and complex nature of these systems entails the agents to learn the optimal solutions on their own instead of following a pre-programmed strategy. Reinforcement learning provides a framework in which agents learn optimal behavior based on the response obtained from the environment. In this thesis, we propose various novel de- centralized, learning automaton based algorithms which can be employed by a group of interacting learning automata. We propose a completely decentralized version of the estimator algorithm. As compared to the completely centralized versions proposed before, this completely decentralized version proves to be a great improvement in terms of space complexity and convergence speed. The decentralized learning algorithm was applied; for the first time; to the domains of distributed object tracking and distributed watershed management. The results obtained by these experiments show the usefulness of the decentralized estimator algorithms to solve complex optimization problems. Taking inspiration from the completely decentralized learning algorithm, we propose the novel concept of partial decentralization. The partial decentralization bridges the gap between the completely decentralized and completely centralized algorithms and thus forms a comprehensive and continuous spectrum of multi-agent algorithms for the learning automata. To demonstrate the applicability of the partial decentralization, we employ a partially decentralized team of learning automata to control multi-agent Markov chains. More flexibility, expressiveness and flavor can be added to the partially decentralized framework by allowing different decentralized modules to engage in different types of games. We propose the novel framework of heterogeneous games of learning automata which allows the learning automata to engage in disparate games under the same formalism. We propose an algorithm to control the dynamic zero-sum games using heterogeneous games of learning automata.
(10223831), Yuankun Fu. "Accelerated In-situ Workflow of Memory-aware Lattice Boltzmann Simulation and Analysis." Thesis, 2021.
Знайти повний текст джерела(9179300), Evgenia-Maria Kontopoulou. "RANDOMIZED NUMERICAL LINEAR ALGEBRA APPROACHES FOR APPROXIMATING MATRIX FUNCTIONS." Thesis, 2020.
Знайти повний текст джерелаThis work explores how randomization can be exploited to deliver sophisticated
algorithms with provable bounds for: (i) The approximation of matrix functions, such
as the log-determinant and the Von-Neumann entropy; and (ii) The low-rank approximation
of matrices. Our algorithms are inspired by recent advances in Randomized
Numerical Linear Algebra (RandNLA), an interdisciplinary research area that exploits
randomization as a computational resource to develop improved algorithms for
large-scale linear algebra problems. The main goal of this work is to encourage the
practical use of RandNLA approaches to solve Big Data bottlenecks at industrial
level. Our extensive evaluation tests are complemented by a thorough theoretical
analysis that proves the accuracy of the proposed algorithms and highlights their
scalability as the volume of data increases. Finally, the low computational time and
memory consumption, combined with simple implementation schemes that can easily
be extended in parallel and distributed environments, render our algorithms suitable
for use in the development of highly efficient real-world software.
Rodrigues, David Manuel de Sousa. "Detecção de comunidades no sistema de correio electrónico universitário." Master's thesis, 2009. http://hdl.handle.net/10071/2874.
Повний текст джерелаThe study of structured systems in social networks has gone through several developments by the use of graph theory in social sciences. On aspect that has been given considerable attention in recent years is the module or community detection in social networks. Several algorithms and strategies have been developed to identify the structure behind social interaction. Through a case study we show the existence of communities based on informal communication that use the email system at ISCTE. We applied a set of hierarchical algorithms to detect communities. Also, we analyzed the hierarchical structure through the k-cores method and verified the transitivity of the communities detected through clique percolation to put in evidence that informal communities are transversal to the institution departments. We also used a information variation measure to compare distances between different clusterings. We built a multi-agent simulation to model the informal communication mechanism of the email system, CIUCEU. This is used to verify the dependence of the system on the notion of social neighborhood, in the teachers network of ISCTE. We also analyzed the usage of real data and concluded on its implications of the sampling and drawing os multi-agent simulations.
Bhattacharya, Indranil. "Feature Selection under Multicollinearity & Causal Inference on Time Series." Thesis, 2017. http://etd.iisc.ernet.in/2005/3980.
Повний текст джерелаKlimanis, Nils. "Generic Programming and Algebraic Multigrid for Stabilized Finite Element Methods." Doctoral thesis, 2006. http://hdl.handle.net/11858/00-1735-0000-0006-B38C-5.
Повний текст джерела