Log in

Relevant bibliographies by topics / Algorithmic / Dissertations / Theses

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

Dissertations / Theses on the topic 'Algorithmic'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Algorithmic.'

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

Davidsdottir, Agnes. "Algorithms, Turing machines and algorithmic undecidability." Thesis, Uppsala universitet, Algebra och geometri, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-441282.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Li, Quan Ph D. Massachusetts Institute of Technology. "Algorithms and algorithmic obstacles for probabilistic combinatorial structures." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/115765.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 209-214).<br>We study efficient average-case (approximation) algorithms for combinatorial optimization problems, as well as explore the algorithmic obstacles for a variety of discrete optimization problems arising in the theory of random graphs, statistics and machine learning. In particular, we consider the average-case optimization for three NP-hard combinatorial optimization problems: La

APA, Harvard, Vancouver, ISO, and other styles

3

von, Dincklage D. "Algorithmic optimizations." Connect to online resource, 2007. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3284474.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bădoiu, Mihai 1978. "Algorithmic embeddings." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/37898.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.<br>Includes bibliographical references (p. 233-242).<br>We present several computationally efficient algorithms, and complexity results on low distortion mappings between metric spaces. An embedding between two metric spaces is a mapping between the two metric spaces and the distortion of the embedding is the factor by which the distances change. We have pioneered theoretical work on relative (or approximation) version of this problem. In this setting, the question is the followi

APA, Harvard, Vancouver, ISO, and other styles

5

Loon, Joyce van. "Algorithmic pricing." Maastricht : Maastricht : Universitaire Pers ; University Library, Universiteit Maastricht [host], 2009. http://arno.unimaas.nl/show.cgi?fid=14955.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Roio, Denis. "Algorithmic sovereignty." Thesis, University of Plymouth, 2018. http://hdl.handle.net/10026.1/11101.

Full text

Abstract:

This thesis describes a practice based research journey across various projects dealing with the design of algorithms, to highlight the governance implications in design choices made on them. The research provides answers and documents methodologies to address the urgent need for more awareness of decisions made by algorithms about the social and economical context in which we live. Algorithms consitute a foundational basis across different fields of studies: policy making, governance, art and technology. The ability to understand what is inscribed in such algorithms, what are the consequences

APA, Harvard, Vancouver, ISO, and other styles

7

Eriksson, Daniel. "Algorithmic Design of Graphical Resources for Games Using Genetic Algorithms." Thesis, Linköpings universitet, Interaktiva och kognitiva system, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-139332.

Full text

Abstract:

Producing many varying instances of the same type of graphical resource for games can be of interest, such as trees or foliage. But when randomly generating graphical resources, you can often end up with many similar looking results or perhaps results that doesn't look like what it is meant to look like. This work investigates whether genetic algorithms can be applied to produce greater varying results when generating graphical resources by basing the fitness of each individual for each genetic generation on how similar the graphical resource is to previously generated resources. This work con

APA, Harvard, Vancouver, ISO, and other styles

8

Mehta, Aranyak. "Algorithmic Game Theory." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7220.

Full text

Abstract:

The interaction of theoretical computer science with game theory and economics has resulted in the emergence of two very interesting research directions. First, it has provided a new model for algorithm design, which is to optimize in the presence of strategic behavior. Second, it has prompted us to consider the computational aspects of various solution concepts from game theory, economics and auction design which have traditionally been considered mainly in a non-constructive manner. In this thesis we present progress along both these directions. We first consider optimization problems that a

APA, Harvard, Vancouver, ISO, and other styles

9

Gidney, Mark Sanford. "Algorithmic visual servoing." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/NQ29465.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Raczinski, Fania. "Algorithmic meta-creativity." Thesis, De Montfort University, 2016. http://hdl.handle.net/2086/17603.

Full text

Abstract:

Tl;dr: Using computers to produce creative artefacts is a form of computational creativity. Using creative techniques computationally is creative computing. Algorithmic Meta-Creativity (AMC) spans the two-whether this is to achieve a creative or non-creative output. Creativity in humans needs to be interpreted differently to machines. Humans and machines differ in many ways, we have different 'brains/memory', 'thinking processes/software' and 'bodies/hardware'. Often creative output by machines is judged in human terms. Computers which are truly artificially intelligent might be capable of tru

APA, Harvard, Vancouver, ISO, and other styles

11

Cooke, Alexander. "Algorithmic Stochastic Music." Case Western Reserve University School of Graduate Studies / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=case1492096098674462.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Whaley, Gareth A. "Algorithmic Congressional Redistricting." Ohio University Honors Tutorial College / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ouhonors1556293096705864.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Jackson, Delbert Wayne. "A.I. - Algorithmic Interactions." Thesis, University of Iowa, 2013. https://ir.uiowa.edu/etd/2528.

Full text

Abstract:

This thesis will talk about how I created artwork when I started graduate school, how my artwork evolved as I explored what art making meant to me and how my thoughts about art making has developed. I will then conclude with talking about the artwork I produced for my thesis show and how that work was shaped by my previous observations and artworks.

APA, Harvard, Vancouver, ISO, and other styles

14

Vialette, Stéphane. "Algorithmic Contributions to Computational Molecular Biology." Habilitation à diriger des recherches, Université Paris-Est, 2010. http://tel.archives-ouvertes.fr/tel-00862069.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Ramage, Stephen Edward Andrew. "Advances in meta-algorithmic software libraries for distributed automated algorithm configuration." Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/52809.

Full text

Abstract:

A meta-algorithmic procedure is a computer procedure that operates upon another algorithm and its associated design space to produce another algorithm with desirable properties (e.g., faster runtime, better solution quality, ...; see e.g., Hoos [2008]). Many meta-algorithmic procedures have runtimes that are dominated by the runtime of the algorithm being operated on. This holds in particular for automatic algorithm configurators, such as ParamILS, SMAC, and GGA, which serve to optimize the design (expressed through user settable parameters) of an algorithm under certain use cases. Consequentl

APA, Harvard, Vancouver, ISO, and other styles

16

Jecker, Ismaël Robin. "Algorithmic Properties of Transducers." Doctoral thesis, Universite Libre de Bruxelles, 2019. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/286313.

Full text

Abstract:

In this thesis, we consider three fundamental problems of transducers theory. The containment problem asks, given two transducers,whether the relation defined by the first is included into the relation defined by the second. The equivalence problem asks, given two transducers,whether they define the same relation. Finally, the sequential uniformisation problem,corresponding to the synthesis problem in the setting of transducers,asks, given a transducer, whether it is possible to deterministically pick an output correspondingto each input of its domain. These three decision problems are undecid

APA, Harvard, Vancouver, ISO, and other styles

17

Razumňak, Michal. "Algorithmic Trading of Pairs." Master's thesis, Vysoká škola ekonomická v Praze, 2017. http://www.nusl.cz/ntk/nusl-360578.

Full text

Abstract:

Pair trading is a well-known strategy based on statistical arbitrage. This strategy uses a short-term deviation from the mean value of the price ratio of two highly correlated stocks from the same sector as the opportunity to open a position. When ratio returns to its mean value again, the position closes. This strategy has been used for many years and the main outcome of this thesis was to test whether this strategy can be profitable even in current market conditions. For that purpose, data ranging from 2010 to April 2017 on all stocks included in the S&P 500 index were used. It was subsequen

APA, Harvard, Vancouver, ISO, and other styles

18

Zois, Georgios. "Algorithmic problems in power management of computing systems." Electronic Thesis or Diss., Paris 6, 2014. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2014PA066462.pdf.

Full text

Abstract:

Cette thèse se focalise sur des algorithmes efficaces en énergie pour des problèmes d'ordonnancement de tâches sur des processeurs pouvant varier la vitesse d'exécution ainsi que sur des processeurs fonctionnant sous un mécanisme de réchauffement-refroidissement, où pour un budget d'énergie donné ou un seuil thermique, l'objectif consiste à optimiser un critère de Qualité de Service. Une partie de notre recherche concerne des problèmes d'ordonnancement de tâches apparaissant dans des environnements de traitement de grandes données. Dans ce contexte, nous nous focalisons sur le paradigme MapRed

APA, Harvard, Vancouver, ISO, and other styles

19

Yuan, Jiangchuan. "Risk diversification framework in algorithmic trading." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/51905.

Full text

Abstract:

We propose a systematic framework for designing adaptive trading strategies that minimize both the mean and the variance of the execution costs. This is achieved by diversifying risk over sequential decisions in discrete time. By incorporating previous trading performance as a state variable, the framework can dynamically adjust the risk-aversion level for future trading. This incorporation also allows the framework to solve the mean-variance problems for different risk aversion factors all at once. After developing this framework, it is then applied to solve three algorithmic trading problems

APA, Harvard, Vancouver, ISO, and other styles

20

Zois, Georgios. "Algorithmic problems in power management of computing systems." Thesis, Paris 6, 2014. http://www.theses.fr/2014PA066462/document.

Full text

Abstract:

Cette thèse se focalise sur des algorithmes efficaces en énergie pour des problèmes d'ordonnancement de tâches sur des processeurs pouvant varier la vitesse d'exécution ainsi que sur des processeurs fonctionnant sous un mécanisme de réchauffement-refroidissement, où pour un budget d'énergie donné ou un seuil thermique, l'objectif consiste à optimiser un critère de Qualité de Service. Une partie de notre recherche concerne des problèmes d'ordonnancement de tâches apparaissant dans des environnements de traitement de grandes données. Dans ce contexte, nous nous focalisons sur le paradigme MapRed

APA, Harvard, Vancouver, ISO, and other styles

21

Alvarado, Oscar. "Towards algorithmic Experience : Redesigning Facebook’s News Feed." Thesis, Uppsala universitet, Institutionen för informatik och media, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-324605.

Full text

Abstract:

Algorithms currently have direct implications in our democracies and societies, but they also define mostly all our daily activities as users, defining our decisions and promoting different behaviors. In this context, it is necessary to define and think about how to design the different implications that these algorithms have from a user centered perspective, particularly in social media platforms that have such relevance in our information sources and flow. Therefore, the current thesis provides an introduction to the concept of algorithmic experience, trying to study how to implement it for

APA, Harvard, Vancouver, ISO, and other styles

22

Schröder, Anna Marie. "Unboxing The Algorithm : Understandability And Algorithmic Experience In Intelligent Music Recommendation Systems." Thesis, Malmö universitet, Institutionen för konst, kultur och kommunikation (K3), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-43841.

Full text

Abstract:

After decades of black-boxing the existence of algorithms in technologies of daily need, users lack confidence in handling them. This thesis study investigates the use situation of intelligent music recommendation systems and explores how understandability as a principle drawn from sociology, design, and computing can enhance the algorithmic experience. In a Research-Through-Design approach, the project conducted focus user sessions and an expert interview to explore first-hand insights. The analysis showed that users had limited mental models so far but brought curiosity to learn. Explorative

APA, Harvard, Vancouver, ISO, and other styles

23

Saberi, Amin. "Algorithmic Aspects of the Internet." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/6427.

Full text

Abstract:

The goal of this thesis is to use and advance the techniques developed in the field of exact and approximation algorithms for many of the problems arising in the context of the Internet. We will formalize the method of dual fitting and the idea of factor-revealing LP. We use this combination to design and analyze two greedy algorithms for the metric uncapacitated facility location problem. Their approximation factors are 1.861 and 1.61 respectively. We also provide the first polynomial time algorithm for the linear version of a market equilibrium model defined by Irving Fisher in 1891. Our alg

APA, Harvard, Vancouver, ISO, and other styles

24

Óbdržálek, Jan. "Algorithmic analysis of parity games." Thesis, University of Edinburgh, 2006. http://hdl.handle.net/1842/25034.

Full text

Abstract:

In this thesis we add to the body of work on parity games. We start by presenting parity games and explaining the concepts behind them, giving a survey of known algorithms, and show their relationship to other problems. In the second part of the thesis we want to answer the following question: Are there classes of graphs on which we can solve parity games in polynomial time? Tree-width has long been considered the most important connectivity measure of (undirected) graphs, and we give a polynomial algorithm for solving parity games on graphs of bounded tree-width. However tree-width is not the

APA, Harvard, Vancouver, ISO, and other styles

25

Sundström, Mikael. "Some aspects of algorithmic engineering." Licentiate thesis, Luleå tekniska universitet, Datavetenskap, 1997. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-17405.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Falk, Andreas, and Johannes Moberg. "Algorithmic trading using MACD signals." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-146011.

Full text

Abstract:

Todays stock market is dominated by algorithmic trading either as helpful tool for trading decisions or as a fully automatic trader. We test howa fully automated trading algorithm using MACD signals as indicatorsperform on historical stock data. The purpose of this essay is to seehow a simple algorithm performs and get a better understanding ofeconomical forecasting.

APA, Harvard, Vancouver, ISO, and other styles

27

Nassef, Hazem Mohamed Osame. "Modeling DQDB, an algorithmic approach." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq22645.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Rajagopal, Murali. "Protocol conversion : an algorithmic approach." Diss., Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/13352.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Levine, Nathan J. "Exploring Algorithmic Musical Key Recognition." Scholarship @ Claremont, 2015. http://scholarship.claremont.edu/cmc_theses/1101.

Full text

Abstract:

The following thesis outlines the goal and process of algorithmic musical key detection as well as the underlying music theory. This includes a discussion of signal-processing techniques intended to most accurately detect musical pitch, as well as a detailed description of the Krumhansl-Shmuckler (KS) key-finding algorithm. It also describes the Java based implementation and testing process of a musical key-finding program based on the KS algorithm. This thesis provides an analysis of the results and a comparison with the original algorithm, ending with a discussion of the recommended directio

APA, Harvard, Vancouver, ISO, and other styles

30

Weingartner, Stephan G. "System development : an algorithmic approach." Virtual Press, 1987. http://liblink.bsu.edu/uhtbin/catkey/483077.

Full text

Abstract:

The subject chosen to develop this thesis project on is developing an algorithm or methodology for system selection. The specific problem studied involves a procedure to determine anion computer system alternative is the best choice for a given user situation.The general problem to be addressed is the need for one to choose computing hardware, software, systems, or services in a -Logical approach from a user perspective, considering cost, performance and human factors. Most existing methods consider only cost and performance factors, combining these factors in ad hoc, subjective fashions to re

APA, Harvard, Vancouver, ISO, and other styles

31

Mohamed, Manal Abd El-Kadeer Kasem. "Algorithmic issues on string regularities." Thesis, King's College London (University of London), 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.422247.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Ramachandran, Sridhar 1977. "An algorithmic theory of caches." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/87159.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2000.<br>Includes bibliographical references (p. 81-85).<br>by Sridhar Ramachandran.<br>S.M.

APA, Harvard, Vancouver, ISO, and other styles

33

Ansel, Jason (Jason Andrew). "Autotuning programs with algorithmic choice." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/87913.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 231-251).<br>The process of optimizing programs and libraries, both for performance and quality of service, can be viewed as a search problem over the space of implementation choices. This search is traditionally manually conducted by the programmer and often must be repeated when systems, tools, or requirements change. The overriding goal of this work is to automate this search so that pro

APA, Harvard, Vancouver, ISO, and other styles

34

Harry, Drew. "Algorithmic architecture in virtual spaces." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/46579.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2008.<br>Includes bibliographical references (p. 87-92).<br>Much of the recent interest in virtual worlds has focused on using the immersive properties of virtual worlds to recreate an experience like that of interacting face to face with other participants. This thesis instead focuses on how we can use the distinctive properties of virtual spaces to create experiences native to virtual worlds. I present two projects that have different perspectives on this concept. Th

APA, Harvard, Vancouver, ISO, and other styles

35

Taptagaporn, Pongphat. "Algorithmic learning from financial predictions." Thesis, London School of Economics and Political Science (University of London), 2017. http://etheses.lse.ac.uk/3514/.

Full text

Abstract:

We study how financial predictions can be used in learning algorithms for problems such as portfolio selection and derivatives pricing, from the perspective of minimizing regret; the worst-case loss (across all possible price paths) against some optimal benchmark model with superior information. Unlike most studies in financial mathematics, we do not make any underlying assumptions beyond the existence of such predictions, so our results are robust in the model-free sense. This thesis consists of three main ideas: 1. Study a portfolio selection model that competes with an optimal static tradin

APA, Harvard, Vancouver, ISO, and other styles

36

Wang, Chengbo. "Financial Applications of Algorithmic Differentiation." Thesis, Uppsala universitet, Tillämpad matematik och statistik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-412943.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Insa, Cabrera David. "Optimization Techniques for Algorithmic Debugging." Doctoral thesis, Universitat Politècnica de València, 2016. http://hdl.handle.net/10251/68506.

Full text

Abstract:

[EN] Nowadays, undetected programming bugs produce a waste of billions of dollars per year to private and public companies and institutions. In spite of this, no significant advances in the debugging area that help developers along the software development process have been achieved yet. In fact, the same debugging techniques that were used 20 years ago are still being used now. Along the time, some alternatives have appeared, but there still is a long way for them to be useful enough to get into the software development process. One of them is algorithmic debugging, which abstracts the inform

APA, Harvard, Vancouver, ISO, and other styles

38

Kanté, Mamadou Moustapha. "Graph structurings : some algorithmic applications." Thesis, Bordeaux 1, 2008. http://www.theses.fr/2008BOR13693/document.

Full text

Abstract:

Tous les problèmes définissables en logique du second ordre monadique peuvent être résolus en temps polynomial dans les classes de graphes qui ont une largeur de clique bornée. La largeur de clique est un paramètre de graphe défini de manière algébrique, c'est-à-dire, à partir d'opérations de composition de graphes. La largeur de rang, définie de manière combinatoire, est une notion équivalente à la largeur de clique des graphes non orientés. Nous donnons une caractérisation algébrique de la largeur de rang et nous montrons qu'elle est linéairement bornée par la largeur arborescente. Nous prop

APA, Harvard, Vancouver, ISO, and other styles

39

Becerra, David J. "Algorithmic Approaches to Playing Minesweeper." Thesis, Harvard University, 2015. http://nrs.harvard.edu/urn-3:HUL.InstRepos:14398552.

Full text

Abstract:

This thesis explores the challenges associated with designing a Minesweeper solving algorithm. In particular, it considers how to best start a game, various heuristics for handling guesses, and different strategies for making deterministic deductions. The paper explores the single point approach and the constraint satisfaction problem model for playing Minesweeper. I present two novel implementations of both of these approaches called double set single point and connected components CSP. The paper concludes that the coupled subsets CSP model performs the best overall because of its sophisticat

APA, Harvard, Vancouver, ISO, and other styles

40

Leach, Jeremy L. "Algorithmic composition and musical form." Thesis, University of Bath, 1999. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.571612.

Full text

Abstract:

Throughout history, art has continued to defy the attempts of scholars and analysts to understand it and reduce it to a set of logical principles. As one of many art forms, music has probably attracted the most attention from formal methods of study and analysis. Analysis leads to models and theories of aspects of musical behaviour, and algorithmic composition is the practice of composing according to a set of rules, processes or principles. The goal of this thesis is to elucidate some fundamental aspects of simple intra-musical meanings. If they can be formulated, then it might be possible to

APA, Harvard, Vancouver, ISO, and other styles

41

Espitau, Thomas. "Algorithmic aspects of algebraic lattices." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS474.

Full text

Abstract:

Les réseaux sont des objets mathématiques qui généralisent l'idée concrète de grille dans le plan. Ils jouent un rôle fondamental dans l’étude de nombreux domaines des mathématiques et de l'informatique, notamment la théorie algébrique des nombres et la cryptographie. Ce manuscrit a pour objet les réseaux dits “algébriques", c'est-à-dire construits au-dessus d'un ordre maximal de corps de nombres, en se concentrant particulièrement sur les méthodes calculatoires. Après avoir développé des méthodes génériques autorisant la manipulation certifiée de tels objets, nous nous intéresserons à l’élabo

APA, Harvard, Vancouver, ISO, and other styles

42

Baste, Julien. "Treewidth : algorithmic, combinatorial, and practical aspects." Thesis, Montpellier, 2017. http://www.theses.fr/2017MONTS065.

Full text

Abstract:

Dans cette thèse, nous étudions la complexité paramétrée de problèmes combinatoires dans les graphes. Plus précisément, nous présentons une multitude d’algorithmes de programmation dynamique ainsi que des réductions montrant que certains de ces algorithmes sont optimaux. Nous nous intéressons principalement à la treewidth, un paramètre de graphes pouvant être vu comme une mesure de distance entre la structure d’un graphe et la structure topologique d’un arbre. Certains de nos algorithmes sont aussi paramétrés par la taille de la solution demandée et le degré maximum du graphe donné en entrée.

APA, Harvard, Vancouver, ISO, and other styles

43

Gehrs, Kai Frederik. "Algorithmic methods for ordinary differential equations." [S.l.] : [s.n.], 2006. http://ubdata.uni-paderborn.de/ediss/17/2007/gehrs.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Sabharwal, Ashish. "Algorithmic applications of propositional proof complexity /." Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/6938.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Wuilbaut, Thomas A. I. J. "Algorithmic developments for a multiphysics framework." Doctoral thesis, Universite Libre de Bruxelles, 2008. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210407.

Full text

Abstract:

In this doctoral work, we adress various problems arising when dealing with multi-physical simulations using a segregated (non-monolithic) approach. We concentrate on a few specific problems and focus on the solution of aeroelastic <p>flutter for linear elastic structures in compressible fl<p>ows, conjugate heat transfer for re-entry vehicles including thermo-chemical reactions and finally, industrial electro-chemical plating processes which often include<p>stiff source terms. These problems are often solved using specifically developed<p>solvers, but these cannot easily be reused for differen

APA, Harvard, Vancouver, ISO, and other styles

46

Yi, Fan, and n/a. "Optimal Algorithmic Techniques of LASIK Procedures." Griffith University. School of Engineering, 2006. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20070216.152339.

Full text

Abstract:

Clinical wavefront-guided corneal ablation has been now the most technologically advanced method to reduce the dependence of glasses and contact lenses. It has the potential not only to eliminate spherocylindrical errors but also to reduce higher-order aberrations (HOA). Recent statistics show that more than 96% of the patients who received laser in situ keratomileusis (LASIK) treatment reported their satisfaction about the improvement on vision, six months after the surgery. However, there are still patients complaining that their vision performance did not achieve the expectation or was even

APA, Harvard, Vancouver, ISO, and other styles

47

Nell, Christopher Warren. "Automating meta-algorithmic analysis and design." Thesis, University of British Columbia, 2011. http://hdl.handle.net/2429/38247.

Full text

Abstract:

Sophisticated empirical methods based upon automated experimental analysis techniques drive the development of high-performance solvers for an increasing range of problems from industry and academia. However, tools implementing these methods are often difficult to develop and to use. This thesis describes work towards addressing this issue. First, we develop a formal description of meta-algorithmic problems, and use it as the basis for a framework supporting the development and application of a broad class of automated algorithm analysis and design techniques. Second, we describe the High-perf

APA, Harvard, Vancouver, ISO, and other styles

48

O'Malley, Gregg. "Algorithmic aspects of stable matching problems." Thesis, University of Glasgow, 2007. http://theses.gla.ac.uk/64/.

Full text

Abstract:

The Stable Marriage problem (SM), the Hospitals/Residents problem (HR) and the Stable Roommates problem (SR) are three classical stable matching problems that were first studied by Gale and Shapley in 1962. These problems have widespread practical application in centralised automated matching schemes, which assign applicants to posts based on preference lists and capacity constraints in both the UK and internationally. Within such schemes it is often the case that an agent's preference list may be incomplete, and agents may also be allowed to express indifference in the form of ties. In the pr

APA, Harvard, Vancouver, ISO, and other styles

49

Dizona, Jill. "On Algorithmic Fractional Packings of Hypergraphs." Scholar Commons, 2012. http://scholarcommons.usf.edu/etd/4029.

Full text

Abstract:

Let F0 be a fixed k-uniform hypergraph, and let H be a given k-uniform hypergraph on n vertices. An F0-packing of H is a family F of edge-disjoint copies of F0 which are subhypergraphs in H. Let nF0(H) denote the maximum size |F| of an F0-packing F of H. It is well-known that computing nF0(H) is NP-hard for nearly any choice of F0. In this thesis, we consider the special case when F0 is a linear hypergraph, that is, when no two edges of F0 overlap in more than one vertex. We establish for z > 0 and n &ge n0(z) sufficiently large, an algorithm which, in time polynomial in n, constructs an F0-p

APA, Harvard, Vancouver, ISO, and other styles

50

Jacob, Philipp-Maximilian. "Towards algorithmic use of chemical data." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/275643.

Full text

Abstract:

The growth of chemical knowledge available via online databases opens opportunities for new types of chemical research. In particular, by converting the data into a network, graph theoretical approaches can be used to study chemical reactions. In this thesis several research questions from the field of data science and graph theory are re-formulated for the chemistry-specific data. Firstly, the structure of chemical reactions data was studied using graph theory. It was found that the network of reactions obtained from the Reaxys data was scale-free, that on average any two species were separat

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!