Log in

Relevant bibliographies by topics / Search algorithms / Dissertations / Theses

Dissertations / Theses on the topic 'Search algorithms'

To see the other types of publications on this topic, follow the link: Search algorithms.

Author: Grafiati

Published: 4 June 2021

Last updated: 20 February 2023

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 'Search algorithms.'

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

Hein, Birgit. "Quantum search algorithms." Thesis, University of Nottingham, 2010. http://eprints.nottingham.ac.uk/11512/.

Full text

Abstract:

In this thesis two quantum search algorithms on two different graphs, a hypercube and a d-dimensional square lattice, are analysed and some applications of the lattice search are discussed. The approach in this thesis generalises a picture drawn by Shenvi, Kempe and Whaley, which was later adapted by Ambainis, Kempe and Rivosh. It defines a one parameter family of unitary operators U_λ with parameter λ. It will be shown that two eigenvalues of U_λ form an avoided crossing at the λ-value where U_λ is equal to the old search operator. This generalised picture opens the way for a construction of two approximate eigen- vectors at the crossing and gives rise to a 2×2 model Hamiltonian that is used to approximate the operator U_λ near the crossing. The thus defined Hamiltonian can be used to calculate the leading order of search time and success probability for the search. To the best of my knowledge only the scaling of these quantities has been known. For the algorithm searching the regular lattice, a generalisation of the model Hamiltonian for m target vertices is constructed. This algorithm can be used to send a signal from one vertex of the graph to a set of vertices. The signal is transmitted between these vertices exclusively and is localised only on the sender and the receiving vertices while the probability to measure the signal at one of the remaining vertices is significantly smaller. However, this effect can be used to introduce an additional sender to search settings and send a continuous signal to all target vertices where the signal will localise. This effect is an improvement compared to the original search algorithm as it does not need to know the number of target vertices.

APA, Harvard, Vancouver, ISO, and other styles

2

Dow, P. Alex. "Search algorithms for exact treewidth." Diss., Restricted to subscribing institutions, 2010. http://proquest.umi.com/pqdweb?did=2023774451&sid=1&Fmt=2&clientId=1564&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Gambardella, Luca Maria. "Coupling ant colony system with local search." Doctoral thesis, Universite Libre de Bruxelles, 2015. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209045.

Full text

Abstract:

In the last decades there has been a lot of interest in computational models and metaheuristics algorithms capable to solve combinatorial optimization problems. The recent trend is to define these algorithms taking inspiration by the observation of natural systems. In this thesis the Ant Colony System (ACS) is presented which has been inspired by the observation of real ant colonies. ACS is initially proposed to solve the symmetric and asymmetric travelling salesman problems where it is shown to be competitive with other metaheuristics. Although this is an interesting and promising result, it was immediately clear that ACS, as well as other metaheuristics, in many cases cannot compete with specialized local search methods. An interesting trend is therefore to couple metaheuristics with a local optimizer, giving birth to so-called hybrid methods. Along this line, the thesis investigates MACS-VRPTW (Multiple ACS for the Vehicle Routing Problem with Time Windows) and HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem (SOP). In the second part the thesis introduces some modifications of the original ACS algorithm. These modifications are able to speed up the method and to make it more competitive in case of large problem instances. The resulting framework, called Enhanced Ant Colony System is tested for the SOP. Finally the thesis presents the application of ACS to solve real-life vehicle routing problems where additional constraints and stochastic information are included.
Doctorat en Sciences de l'ingénieur
info:eu-repo/semantics/nonPublished

APA, Harvard, Vancouver, ISO, and other styles

4

Trippen, Gerhard Wolfgang. "Online exploration and search in graphs /." View abstract or full-text, 2006. http://library.ust.hk/cgi/db/thesis.pl?COMP%202006%20TRIPPE.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kibriya, Ashraf Masood. "Fast Algorithms for Nearest Neighbour Search." The University of Waikato, 2007. http://hdl.handle.net/10289/2463.

Full text

Abstract:

The nearest neighbour problem is of practical significance in a number of fields. Often we are interested in finding an object near to a given query object. The problem is old, and a large number of solutions have been proposed for it in the literature. However, it remains the case that even the most popular of the techniques proposed for its solution have not been compared against each other. Also, many techniques, including the old and popular ones, can be implemented in a number of ways, and often the different implementations of a technique have not been thoroughly compared either. This research presents a detailed investigation of different implementations of two popular nearest neighbour search data structures, KDTrees and Metric Trees, and compares the different implementations of each of the two structures against each other. The best implementations of these structures are then compared against each other and against two other techniques, Annulus Method and Cover Trees. Annulus Method is an old technique that was rediscovered during the research for this thesis. Cover Trees are one of the most novel and promising data structures for nearest neighbour search that have been proposed in the literature.

APA, Harvard, Vancouver, ISO, and other styles

6

Wong, Brian Wai Fung. "Deep-web search engine ranking algorithms." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/61246.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 79-80).
The deep web refers to content that is hidden behind HTML forms. The deep web contains a large collection of data that are unreachable by link-based search engines. A study conducted at University of California, Berkeley estimated that the deep web consists of around 91,000 terabytes of data, whereas the surface web is only about 167 terabytes. To access this content, one must submit valid input values to the HTML form. Several researchers have studied methods for crawling deep web content. One of the most promising methods uses unique wrappers for HTML forms. User inputs are first filtered through the wrappers before being submitted to the forms. However, this method requires a new algorithm for ranking search results generated by the wrappers. In this paper, I explore methods for ranking search results returned from a wrapped-based deep web search engine.
by Brian Wai Fung Wong.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

7

Yu, Jenn-Hwa. "Probabilistic analysis of some search algorithms /." The Ohio State University, 1990. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487683756126241.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Orr, Genevieve Beth. "Dynamics and algorithms for stochastic search /." Full text open access at:, 1995. http://content.ohsu.edu/u?/etd,197.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ganai, Malay Kumar. "Algorithms for efficient state space search /." Full text (PDF) from UMI/Dissertation Abstracts International, 2001. http://wwwlib.umi.com/cr/utexas/fullcit?p3008331.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Kroyan, Julia. "Trust-search algorithms for unconstrained optimization /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2004. http://wwwlib.umi.com/cr/ucsd/fullcit?p3120456.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Furrow, Bartholomew. "A panoply of quantum algorithms." Thesis, University of British Columbia, 2006. http://hdl.handle.net/2429/75.

Full text

Abstract:

This thesis’ aim is to explore improvements to, and applications of, a fundamental quantum algorithm invented by Grover. Grover’s algorithm is a basic tool that can be applied to a large number of problems in computer science, creating quantum algorithms that are polynomially faster than fastest known and fastest possible classical algorithms that solve the same problems. Our goal in this thesis is to make these techniques readily accessible to those without a strong background in quantum physics: we achieve this by providing a set of tools, each of which makes use of Grover’s algorithm or similar techniques, that can be used as subroutines in many quantum algorithms. The tools we provide are carefully constructed: they are easy to use, and they are asymptotically faster than the best tools previously available. The tools that we supersede include algorithms by Boyer, Brassard, Hoyer and Tapp, Buhrman, Cleve, de Witt and Zalka and Durr and Hoyer. After creating our tools, we create several new quantum algorithms, each of which is faster than the fastest known classical algorithm that accomplishes the same aim, and some of which are faster than the fastest possible classical algorithm. These algorithms come from graph theory, computational geometry and dynamic programming. We discuss a breadth-first search that is faster than (edges) (the classical limit) in a dense graph, maximum-points-on-a-line in (N3/2 lgN) (faster than the fastest classical algorithm known), as well as several other algorithms that are similarly illustrative of solutions in some class of problem. Through these new algorithms we illustrate the use of our tools, working to encourage their use and the study of quantum algorithms in general.

APA, Harvard, Vancouver, ISO, and other styles

12

INAGAKI, Yasuyoshi, Tomio HIRATA, and Xuehou TAN. "Designing Efficient Geometric Search Algorithms Using Persistent Binary-Binary Search Trees." Institute of Electronics, Information and Communication Engineers, 1994. http://hdl.handle.net/2237/15061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Lidberg, Simon. "Evolving Cuckoo Search : From single-objective to multi-objective." Thesis, Högskolan i Skövde, Institutionen för teknik och samhälle, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-5309.

Full text

Abstract:

This thesis aims to produce a novel multi-objective algorithm that is based on Cuckoo Search by Dr. Xin-She Yang. Cuckoo Search is a promising nature-inspired meta-heuristic optimization algorithm, which currently is only able to solve single-objective optimization problems. After an introduction, a number of theoretical points are presented as a basis for the decision of which algorithms to hybridize Cuckoo Search with. These are then reviewed in detail and verified against current benchmark algorithms to evaluate their efficiency. To test the proposed algorithm in a new setting, a real-world combinatorial problem is used. The proposed algorithm is then used as an optimization engine for a simulation-based system and compared against a current implementation.

APA, Harvard, Vancouver, ISO, and other styles

14

Hicks, Janette M. "Search algorithms for discovery of Web services." Diss., Online access via UMI:, 2005. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:1425747.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Dong, Juan. "Time reversible self-organizing sequential search algorithms." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq22138.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Lančinskas, Algirdas. "Parallelization of random search global optimization algorithms." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2013. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130620_110438-17037.

Full text

Abstract:

Global optimization problems are relevant in various fields of research and industry, such as chemistry, biology, biomedicine, operational research, etc. Normally it is easier to solve optimization problems having some specific properties of objective function such as linearity, convexity, differentiability, etc. However, there are a lot of practical problems that do not satisfy such properties or even cannot be expressed in an adequate mathematical form. Therefore, it is popular to use random search optimization methods in solving such optimization problems. The dissertation deals with investigation of random search global optimization algorithms, their parallelization and application to solve practical problems. The work is focused on modification and parallelization of particle swarm optimization and genetic algorithms. The modification of particle swarm optimization algorithm, based on reduction of the search area is proposed, and several strategies to parallelize the algorithm are investigated. The algorithm is applied to solve Multiple Gravity Assist problem using parallel computing system. A hybrid global multi-objective optimization algorithm is developed by modifying single agent stochastic search strategy, and incorporating it into multi-objective optimization genetic algorithm. Several strategies to parallelize multi-objective optimization genetic algorithm is proposed. Parallel algorithms are experimentally investigated by solving competitive facility location... [to full text]
Optimizavimo uždaviniai sutinkami įvairiose mokslo ir pramonės srityse, tokiose kaip chemija, biologija, biomedicina, operacijų tyrimai ir pan. Paprastai efektyviausiai sprendžiami uždaviniai, turintys tam tikras savybes, tokias kaip tikslo funkcijų tiesiškumas, iškilumas, diferencijuojamumas ir pan. Tačiau ne visi praktikoje pasitaikantys optimizavimo uždaviniai tenkina šias savybes, o kartais iš vis negali būti išreiškiami adekvačia matematine išraiška. Tokiems uždaviniam spręsti yra populiarūs atsitiktinės paieškos optimizavimo metodai. Disertacijoje yra tiriami atsitiktinės paieškos optimizavimo metodai, jų lygiagretinimo galimybės ir taikymas praktikoje pasitaikantiems uždaviniams spręsti. Pagrindinis dėmesys skiriamas dalelių spiečiaus optimizavimo ir genetinių algoritmų modifikavimui ir lygiagretinimui. Disertacijoje yra siūloma dalelių spiečiaus optimizavimo algoritmo modifikacija, grįsta pieškos srities siaurinimu, ir tiriamos kelios algoritmo lygiagretinimo strategijos. Algoritmas yra taikomas erdvėlaivių skrydžių trajektorijų optimizavimo uždaviniui spręsti lygiagrečiųjų skaičiavimų sistemose. Taip pat yra siūlomas hibridinis globaliojo daugiakriterio optimizavimo algoritmas, gautas modifikuojant vieno agento stochastinės paieškos algoritmą ir įkomponuojant į daugiakriterio optimizavimo genetinį algoritmą. Siūlomos kelios daugiakriterio genetinio algoritmo lygiagretinimo strategijos. Jų pagrindu gauti lygiagretieji algoritmai eksperimentiškai tiriami sprendžiant... [toliau žr. visą tekstą]

APA, Harvard, Vancouver, ISO, and other styles

17

Soongsathitanon, Somphob. "Fast search algorithms for digital video coding." Thesis, University of Newcastle Upon Tyne, 2004. http://hdl.handle.net/10443/1003.

Full text

Abstract:

Motion Estimation algorithm is one of the important issues in video coding standards such as ISO MPEG-1/2 and ITU-T H.263. These international standards regularly use a conventional Full Search (FS) Algorithm to estimate the motion of pixels between pairs of image blocks. Since a FS method requires intensive computations and the distortion function needs to be evaluated many times for each target block. the process is very time consuming. To alleviate this acute problem, new search algorithms, Orthogonal Logarithmic Search (OLS) and Diagonal Logarithmic Search (DLS), have been designed and implemented. The performance of the algorithms are evaluated by using standard 176x 144 pixels quarter common intermediate format (QCIF) benchmark video sequences and the results are compared to the traditional well-known FS Algorithm and a widely used fast search algorithm called the Three Step Search (3SS), The fast search algorithms are known as sub-optimal algorithms as they test only some of the candidate blocks from the search area and choose a match from a subset of blocks. These algorithms can reduce the computational complexity as they do not examine all candidate blocks and hence are algorithmically faster. However, the quality is generally not as good as that of the FS algorithms but can be acceptable in terms of subjective quality. The important metrics, time and Peak Signal to Noise Ratio are used to evaluate the novel algorithms. The results show that the strength of the algorithms lie in their speed of operation as they are much faster than the FS and 3SS. The performance in speed is improved by 85.37% and 22% over the FS and 3SS respectively for the OLS. For the DLS, the speed advantages are 88.77% and 40% over the FS and 3SS. Furthermore, the accuracy of prediction of OLS and DLS are comparahle to the 3SS.

APA, Harvard, Vancouver, ISO, and other styles

18

El-Mihoub, Tarek A. "New hybrid genetic algorithms for parameter search." Thesis, Nottingham Trent University, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.442088.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Garrow, Andrew Gordon. "Search algorithms for transmembrane beta-barrel proteins." Thesis, University of Leeds, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.427773.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Farquhar, Jason D. R. "Incremental search algorithms for on-line planning." Thesis, University of Southampton, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.419158.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Dong, Juan Carleton University Dissertation Computer Science. "Time reversible self-organizing sequential search algorithms." Ottawa, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

22

Kristinsdottir, Birna Pala. "Analysis and development of random search algorithms /." Thesis, Connect to this title online; UW restricted, 1997. http://hdl.handle.net/1773/7108.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Buhler, Jeremy. "Search algorithms for biosequences using random projection /." Thesis, Connect to this title online; UW restricted, 2001. http://hdl.handle.net/1773/6919.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

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. We explore properties of comparison-based algorithms for the problem. A proof of a set expression is the set of comparisons that a comparison-based algorithm performs before it can determine the result of the expression. We discuss the properties of the proofs of set expressions and based on how complex the smallest proofs of a set expression E are, we define a measurement for determining how difficult it is for E to be computed. Then, we design an algorithm that is adaptive to the difficulty of the input expression and we show that the running time of the algorithm is roughly proportional to difficulty of the input expression, where the factor is roughly logarithmic in the number of the operands of the input expression.

APA, Harvard, Vancouver, ISO, and other styles

25

Yuan, Wenjun, and 袁文俊. "Flexgraph: flexible subgraph search in large graphs." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B46087539.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Derrick, Deborah Chippington. "Models, methods and algorithms for supply chain planning." Thesis, Brunel University, 2011. http://bura.brunel.ac.uk/handle/2438/6024.

Full text

Abstract:

An outline of supply chains and differences in the problem types is given. The motivation for a generic framework is discussed and explored. A conceptual model is presented along with it application to real world situations; and from this a database model is developed. A MIP and CP implementations are presented; along with alternative formulation which can be use to solve the problems. A local search solution algorithm is presented and shown to have significant benefits. Problem instances are presented which are used to validate the generic models, including a large manufacture and distribution problem. This larger problem instance is not only used to explore the implementation of the models presented, but also to explore the practically of the use of alternative formulation and solving techniques within the generic framework and the effectiveness of such methods including the neighbourhood search solving method. A stochastic dimension to the generic framework is explored, and solution techniques for this extension are explored, demonstrating the use of solution analysis to allow problem simplification and better solutions to be found. Finally the local search algorithm is applied to the larger models that arise from inclusion of scenarios, and the methods is demonstrated to be powerful for finding solutions for these large model that were insoluble using the MIP on the same hardware.

APA, Harvard, Vancouver, ISO, and other styles

27

Béjar, Torres Ramón. "Systematic and local search algorithms for regular-SAT." Doctoral thesis, Universitat Autònoma de Barcelona, 2000. http://hdl.handle.net/10803/3018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Kamphans, Thomas. "Models and algorithms for online exploration and search." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=980408121.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Palanivelu, Arul Durai Murugan. "Tree search algorithms for joint detection and decoding." Columbus, Ohio : Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1145039374.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Dinh, Hieu Trung. "Algorithms for DNA Sequence Assembly and Motif Search." University of Connecticut, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

31

Zahrani, Mohammed Saeed. "Genetic local search algorithms for selected graph problems." Thesis, University of Hertfordshire, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.440188.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Szeto, Raymond W. L. (Raymond Wen Li) 1977. "Clamping-simplex methods : improved direct search simplex algorithms." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86829.

Full text

Abstract:

Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
Includes bibliographical references (leaf 66).
by Raymond W.L. Szeto.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

33

Land, Mark William Shannon. "Evolutionary algorithms with local search for combinatorial optimization /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1998. http://wwwlib.umi.com/cr/ucsd/fullcit?p9914083.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Richards, Emory Thomas. "No-good learning and non-systematic search." Thesis, Imperial College London, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.314083.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Bedrax-Weiss, Tania. "Optimal search protocols /." view abstract or download file of text, 1999. http://wwwlib.umi.com/cr/uoregon/fullcit?p9948016.

Full text

Abstract:

Thesis (Ph. D.)--University of Oregon, 1999.
Typescript. Includes vita and abstract. Includes bibliographical references (leaves 206-211). Also available for download via the World Wide Web; free to University of Oregon users. Address: http://wwwlib.umi.com/cr/uoregon/fullcit?p9948016.

APA, Harvard, Vancouver, ISO, and other styles

36

WU, CHEN. "OPTIMAL FEATURE SUBSET SELECTION ALGORITHMS FOR UNSUPERVISED LEARNING." University of Cincinnati / OhioLINK, 2000. http://rave.ohiolink.edu/etdc/view?acc_num=ucin974896296.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Jacobson, David L. "Using genetic algorithms to search large, unstructured databases : the search for Desert Storm Syndrome /." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1996. http://handle.dtic.mil/100.2/ADA320421.

Full text

Abstract:

Thesis (M.S. in Information Technology Management) Naval Postgraduate School, September 1996.
"September 1996." Thesis advisor(s): H.K. Bhargave. Includes bibliographical references (p. 139). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

38

Barnett, Lionel. "Evolutionary search on fitness landscapes with neutral networks." Thesis, University of Sussex, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.288614.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Savulionienė, Loreta. "Association rules search in large data bases." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2014. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2014~D_20140519_102242-45613.

Full text

Abstract:

The impact of information technology is an integral part of modern life. Any activity is related to information and data accumulation and storage, therefore, quick analysis of information is necessary. Today, the traditional data processing and data reports are no longer sufficient. The need of generating new information and knowledge from given data is understandable; therefore, new facts and knowledge, which allow us to forecast customer behaviour or financial transactions, diagnose diseases, etc., can be generated applying data mining techniques. The doctoral dissertation analyses modern data mining algorithms for estimating frequent sub-sequences and association rules. The dissertation proposes a new stochastic algorithm for mining frequent sub-sequences, its modifications SDPA1 and SDPA2 and stochastic algorithm for discovery of association rules, and presents the evaluation of the algorithm errors. These algorithms are approximate, but allow us to combine two important tests, i.e. time and accuracy. The algorithms have been tested using real and simulated databases.
Informacinių technologijų įtaka neatsiejama nuo šiuolaikinio gyvenimo. Bet kokia veiklos sritis yra susijusi su informacijos, duomenų kaupimu, saugojimu. Šiandien nebepakanka tradicinio duomenų apdorojimo bei įvairių ataskaitų formavimo. Duomenų tyrybos technologijų taikymas leidžia iš turimų duomenų išgauti naujus faktus ar žinias, kurios leidžia prognozuoti veiklą, pavyzdžiui, pirkėjų elgesį ar finansines tendencijas, diagnozuoti ligas ir pan. Disertacijoje nagrinėjami duomenų tyrybos algoritmai dažniems posekiams ir susietumo taisyklėms nustatyti. Disertacijoje sukurtas naujas stochastinis dažnų posekių paieškos algoritmas, jo modifikacijos SDPA1, SDPA2 ir stochastinis susietumo taisyklių nustatymo algoritmas bei pateiktas šių algoritmų paklaidų įvertinimas. Šie algoritmai yra apytiksliai, tačiau leidžia suderinti du svarbius kriterijus  laiką ir tikslumą. Šie algoritmai buvo testuojami naudojant realias bei imitacines duomenų bazes.

APA, Harvard, Vancouver, ISO, and other styles

40

Duan, Zhiping. "Proof search algorithms for detecting interactions in telecommunication features." Thesis, University of Ottawa (Canada), 2003. http://hdl.handle.net/10393/26473.

Full text

Abstract:

This thesis presents a theorem proving approach to automatically detecting feature interactions in telecommunications systems. Feature requirements are formalized as specifications using Linear Temporal Logic (LTL) formulas and feature conflicts are specified by LTL formulas expressing logical inconsistency of specifications of two requirements of two different features. These LTL formulas are translated into First-Order Logic (FOL) formulas. We begin with an existing FOL theorem prover and optimize and enrich this prover for our application. In particular, we develop algorithms for integers and relational expressions which appear in translated FOL formulas and integrate these algorithms into the existing proof search procedure. Implementation and experiments in lambdaProlog demonstrate that our theorem prover is efficient and powerful when applied to the task of feature interaction detection. We also develop a proof checker to verify proofs obtained from our prover.

APA, Harvard, Vancouver, ISO, and other styles

41

Zekaoui, Latifa. "Mixed covering arrays on graphs and tabu search algorithms." Thesis, University of Ottawa (Canada), 2006. http://hdl.handle.net/10393/27433.

Full text

Abstract:

Covering arrays are combinatorial objects that have been successfully applied in the design of test suits for testing software, networks and circuits. Mixed covering arrays on graphs are new generalizations of both mixed covering arrays and covering arrays on graphs. In this thesis, we give new theoretical results and constructions for mixed covering arrays on graphs. First, we extend to the mixed case the work done by Meagher and Stevens [31], which uses graph homomorphisms for covering arrays on graphs. Second, we study covering arrays on special classes of graphs. In particular, we solve to optimality the case in which G is a tree, a cycle or a bipartite graph, as well as give results for wheels and cubic graphs. We also provide general graph operations that preserve the size of a balanced covering array. In the second part of the thesis, we do a complete experimental study of two tabu search algorithms for covering array construction. POT is a variation of the algorithm given by Stardom [40] while PAT is an implementation of the algorithm proposed by Nurmela [35]. We conclude that they provide effective methods for constructing covering arrays of moderate size. In particular, POT and PAT improve upper bounds for 18 sets of parameters for covering arrays.

APA, Harvard, Vancouver, ISO, and other styles

42

Milner, Stephen Darren. "The symbiotic use of neural nets in search algorithms." Thesis, University of Nottingham, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.368248.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Yu, Yun William. "Compressive algorithms for search and storage in biological data." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/112879.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2017.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 187-197).
Disparate biological datasets often exhibit similar well-defined structure; efficient algorithms can be designed to exploit this structure. In this doctoral thesis, we present a framework for similarity search based on entropy and fractal dimension; here, we prove that a clustered search algorithm scales in time with metric entropy number of covering hyperspheres-if the fractal dimension is low. Using these ideas, entropy-scaling versions of standard bioinformatics search tools can be designed, including for small-molecule, metagenomics, and protein structure search. This 'compressive acceleration' approach taking advantage of redundancy and sparsity in biological data can be leveraged also for next-generation sequencing (NGS) read mapping. By pairing together a clustered grouping over similar reads and a homology table for similarities in the human genome, our CORA framework can accelerate all-mapping by several orders of magnitude. Additionally, we also present work on filtering empirical base-calling quality scores from Next Generation Sequencing data. By using the sparsity of k-mers of sufficient length in the human genome and imposing a human prior through the use of frequent k-mers in a large corpus of human DNA reads, we are able to quickly discard over 90% of the information found in those quality scores while retaining or even improving downstream variant-calling accuracy. This filtering step allows for fast lossy compression of quality scores.
by Yun William Yu.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

44

Ergun, Özlem 1974. "New neighborhood search algorithms based on exponentially large neighborhoods." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/17517.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2001.
Includes bibliographical references (p. 155-166).
A practical approach for solving computationally intractable problems is to employ heuristic (approximation) algorithms that can find nearly optimal solutions within a reasonable amount of computational time. An improvement algorithm is an approximation algorithm which starts with a feasible solution and iteratively attempts to obtain a better solution. Neighborhood search algorithms (alternatively called local search algorithms) are a wide class of improvement algorithms where at each iteration an improving solution is found by searching the "neighborhood" of the current solution. This thesis concentrates on neighborhood search algorithms where the size of the neighborhood is "very large" with respect to the size of the input data. For large problem instances, it is impractical to search these neighborhoods explicitly, and one must either search a small portion of the neighborhood or else develop efficient algorithms for searching the neighborhood-implicitly. This thesis consists of four parts. Part 1 is a survey of very large scale neighborhood (VLSN) search techniques for combinatorial optimization problems. In Part 2, we concentrate on a VLSN search technique based on compounding independent simple moves such as 2-opts, swaps, and insertions. We show that the search for an improving neighbor can be done by finding a negative cost path on an auxiliary graph. We show how this neighborhood is applied to problems such as the TSP, VRP, and specific single and multiple machine scheduling problems.
(cont.) In Part 3, we discuss dynamic programming approximations for the TSP and a generic set partitioning problem that are based on restricting the state space of the original dynamic programs. Furthermore, we show the equivalence of these restricted DPs to particular neighborhoods that we had considered earlier. Finally, in Part 4, we present the results of a computational study for the compounded independent moves algorithm on the vehicle routing problem with capacity and distance restrictions. These results indicate that our algorithm is competitive with respect to the current heuristics and branch and cut algorithms.
by Özlem Ergun.
Ph.D.

APA, Harvard, Vancouver, ISO, and other styles

45

Czerwinski, Steven E. (Steven Edward). "Exploring the job-shop search space with genetic algorithms." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42747.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.
Includes bibliographical references (leaves 52-53).
by Steven E. Czerwinski.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

46

Razenshteyn, Ilya. "High-dimensional similarity search and sketching : algorithms and hardness." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113934.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 241-255).
We study two fundamental problems that involve massive high-dimensional datasets: approximate near neighbor search (ANN) and sketching. We obtain a number of new results including: ' An algorithm for the ANN problem over the ℓ₁ and ℓ₂ distances that, for the first time, improves upon the Locality-Sensitive Hashing (LSH) framework. The key new insight is to use random space partitions that depend on the dataset. ' An implementation of the core component of the above algorithm, which is released as FALCONN: a new C++ library for high-dimensional similarity search. ' An efficient algorithm for the ANN problem over any distance that can be expressed as a symmetric norm. ' For norms, we establish the equivalence between the existence of short and accurate sketches and good embeddings into ℓp spaces for 0 < p by Ilya Razenshteyn.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

47

Sharpe, Oliver John. "Towards a rational methodology for using evolutionary search algorithms." Thesis, University of Sussex, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.250147.

Full text

Abstract:

Evolutionary search algorithms (ESAs from now on) are iterative problem solvers developed with inspiration from neo-Darwinian survival of the fittest genes. This thesis looks at the core issues surrounding ESAs and is a step towards building a rational methodology for their effective use. Currently there is no such method of best practice rather the whole process of designing and using ESAs is seen as more of a black art than a tried and tested engineering tool. Consequently, many non-practitioners are sceptical of the worth of ESAs as a useful tool at all. Therefore the first task of the thesis is to layout the reasons, from computational theory, why ESAs can be a potentially powerful tool. In this context the theory of NP-completeness is introduced to ground the discussions throughout the thesis. Then a simple framework for describing ESAs is developed to form another cornerstone of these later discussions. From here there are two main themes of the thesis. The first theme is that the No Free Lunch result requires us to take a problem centric, as opposed to algorithm centric, perspective on ESA research. The second major theme is the argument that whole algorithms and traditional computer science problem classes are the wrong level of granularity for the focus of our research. Instead we should be researching empirical questions of search bias at the granularity of the components of search algorithms. Furthermore, we should be finding empirical evidence to demonstrate that our granularity of analytic class is such that one analytic class maps onto one search bias class. We will see that this can mean that we have to sub-divide our classic computer science problems classes into smaller sub-classes. The hope is that we can find analytic distinctions that will sub-divide the instances along lines that match the divisions between the various empirically discoverable search bias classes. The intention is to develop our knowledge until we get one analytic class to map into one empirical class. If we have strong empirical evidence to suggest that this has been achieved then we have good grounds on which to confidently use this knowledge to predict the effective search biases required for new problem instances. In the last two chapters of the thesis we demonstrated these ideas on various instances of the euclidean TSP problem class

APA, Harvard, Vancouver, ISO, and other styles

48

Knowles, Joshua D. "Local-search and hybrid evolutionary algorithms for Pareto optimization." Thesis, University of Reading, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.394429.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Younes, Ahmed. "Practical search algorithms and Boolean circuits for quantum computers." Thesis, University of Birmingham, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.409283.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Lisena, Pasquale. "Knowledge-based music recommendation : models, algorithms and exploratory search." Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS614.

Full text

Abstract:

Représenter l'information décrivant la musique est une activité complexe, qui implique différentes sous-tâches. Ce manuscrit de thèse porte principalement sur la musique classique et étudie comment représenter et exploiter ses informations. L'objectif principal est l'étude de stratégies de représentation et de découverte des connaissances appliquées à la musique classique, dans des domaines tels que la production de base de connaissances, la prédiction de métadonnées et les systèmes de recommandation. Nous proposons une architecture pour la gestion des métadonnées de musique à l'aide des technologies du Web Sémantique. Nous introduisons une ontologie spécialisée et un ensemble de vocabulaires contrôlés pour les différents concepts spécifiques à la musique. Ensuite, nous présentons une approche de conversion des données, afin d’aller au-delà de la pratique bibliothécaire actuellement utilisée, en s’appuyant sur des règles de mapping et sur l’interconnexion avec des vocabulaires contrôlés. Enfin, nous montrons comment ces données peuvent être exploitées. En particulier, nous étudions des approches basées sur des plongements calculés sur des métadonnées structurées, des titres et de la musique symbolique pour classer et recommander de la musique. Plusieurs applications de démonstration ont été réalisées pour tester les approches et les ressources précédentes
Representing the information about music is a complex activity that involves different sub-tasks. This thesis manuscript mostly focuses on classical music, researching how to represent and exploit its information. The main goal is the investigation of strategies of knowledge representation and discovery applied to classical music, involving subjects such as Knowledge-Base population, metadata prediction, and recommender systems. We propose a complete workflow for the management of music metadata using Semantic Web technologies. We introduce a specialised ontology and a set of controlled vocabularies for the different concepts specific to music. Then, we present an approach for converting data, in order to go beyond the librarian practice currently in use, relying on mapping rules and interlinking with controlled vocabularies. Finally, we show how these data can be exploited. In particular, we study approaches based on embeddings computed on structured metadata, titles, and symbolic music for ranking and recommending music. Several demo applications have been realised for testing the previous approaches and resources

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!