To see the other types of publications on this topic, follow the link: Computer science Machine theory.

Dissertations / Theses on the topic 'Computer science Machine theory'

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 'Computer science Machine theory.'

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

Kaelbling, Michael John. "Braced languages and a model of translation for context-free strings : theory and practice /." The Ohio State University, 1987. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487584612166164.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yedidia, Adam. "A relatively small turing machine whose behavior is independent of set theory." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/100680.

Full text
Abstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 79-80).<br>Since the definition of the Busy Beaver function by Radó in 1962, an interesting open question has been what the smallest value of n for which BB(n) is independent of ZFC. Is this n approximately 10, or closer to 1,000,000, or is it unfathomably large? In this thesis, I show that it is at most 340,943 by presenting an explicit description of a 340,943-state Turing machine Z with
APA, Harvard, Vancouver, ISO, and other styles
3

Wong, Shun Ha Sylvia. "An investigation into the use of argument structure and lexical mapping theory for machine translation." Thesis, University of Birmingham, 2000. http://etheses.bham.ac.uk//id/eprint/4656/.

Full text
Abstract:
In recent work on the Lexical-Functional Grammar (LFG) formalism, argument structure (a-structure) and lexical mapping theory have been used to explain many linguistic behaviours across languages. It has been suggested that the combination of c-structure, f-structure and a-structure might form a suitable architecture for Universal Grammar. If this suggestion is valid, the LFG formalism would be a suitable linguistic model for Machine Translation (MT). This thesis reports on the investigations carried out on using a-structure and lexical mapping theory for aiding various sub-tasks in MT. The tw
APA, Harvard, Vancouver, ISO, and other styles
4

Kalyanasundaram, Subrahmanyam. "Turing machine algorithms and studies in quasi-randomness." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42808.

Full text
Abstract:
Randomness is an invaluable resource in theoretical computer science. However, pure random bits are hard to obtain. Quasi-randomness is a tool that has been widely used in eliminating/reducing the randomness from randomized algorithms. In this thesis, we study some aspects of quasi-randomness in graphs. Specifically, we provide an algorithm and a lower bound for two different kinds of regularity lemmas. Our algorithm for FK-regularity is derived using a spectral characterization of quasi-randomness. We also use a similar spectral connection to also answer an open question about quasi-random to
APA, Harvard, Vancouver, ISO, and other styles
5

Menke, Joshua E. "Improving machine learning through oracle learning /." Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd1726.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Raitt, Lesley Anne. "Random generation of finite automata over the domain of the regular languages." Thesis, Stellenbosch : Stellenbosch University, 2006. http://hdl.handle.net/10019.1/19646.

Full text
Abstract:
Thesis (MSc)--University of Stellenbosch, 2007.<br>ENGLISH ABSTRACT: The random generation of finite automata over the domain of their graph structures is a wellknown problem. However, random generation of finite automata over the domain of the regular languages has not been studied in such detail. Random generation algorithms designed for this domain would be useful for the investigation of the properties of the regular languages associated with the finite automata. We studied the existing enumerations and algorithms to randomly generate UDFAs and binary DFAs as they pertained to the do
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Sinong. "Coded Computation for Speeding up Distributed Machine Learning." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1555336880521062.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Altun, Gulsah. "Machine Learning and Graph Theory Approaches for Classification and Prediction of Protein Structure." Digital Archive @ GSU, 2008. http://digitalarchive.gsu.edu/cs_diss/31.

Full text
Abstract:
Recently, many methods have been proposed for the classification and prediction problems in bioinformatics. One of these problems is the protein structure prediction. Machine learning approaches and new algorithms have been proposed to solve this problem. Among the machine learning approaches, Support Vector Machines (SVM) have attracted a lot of attention due to their high prediction accuracy. Since protein data consists of sequence and structural information, another most widely used approach for modeling this structured data is to use graphs. In computer science, graph theory has been widel
APA, Harvard, Vancouver, ISO, and other styles
9

Huysamen, Nico. "FATKID : a Finite Automaton Toolkit." Thesis, Stellenbosch : Stellenbosch University, 2012. http://hdl.handle.net/10019.1/71684.

Full text
Abstract:
Thesis (MSc)--Stellenbosch University, 2012<br>ENGLISH ABSTRACT: This thesis presents the FATKID Finite Automata Toolkit. While a lot of toolkits currently exist which can manipulate and process nite state automata, this toolkit was designed to e ectively and e ciently generate, manipulate and process large numbers of nite automata by distributing the work ow across machines and running the computations in parallel. Other toolkits do not currently provide this functionality. We show that this framework is user-friendly and extremely extensible. Furthermore we show that the system e
APA, Harvard, Vancouver, ISO, and other styles
10

Riggelsen, Carsten. "Approximation methods for efficient learning of Bayesian networks /." Amsterdam ; Washington, DC : IOS Press, 2008. http://www.loc.gov/catdir/toc/fy0804/2007942192.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Streeter, Matthew J. "Automated discovery of numerical approximation formulae via genetic programming." Link to electronic thesis, 2001. http://www.wpi.edu/Pubs/ETD/Available/etd-0426101-231555.

Full text
Abstract:
Thesis (M.S.)--Worcester Polytechnic Institute.<br>Title from title screen. Keywords: genetic programming; approximations; machine learning; artificial intelligence. Includes bibliographical references (p. 92-94).
APA, Harvard, Vancouver, ISO, and other styles
12

Boufoy-Bastick, Zacharyas Amaury. "Internet democracy : the political science and computer science of direct democracy at the large scale." Thesis, Paris 4, 2014. http://www.theses.fr/2014PA040182.

Full text
Abstract:
La démocratie représentative souffre de nombreuses lacunes qui remettent en question la légitimité même des gouvernements démocratiques modernes. Tandis que la représentation directe pourrait théoriquement éliminer ces incongruités, elle a jusqu'à présent été considérée comme irréalisable en raison de limitations spatio-temporelles. Cette thèse adresse ces problèmes en introduisant le concept de Démocratie Internet - distinct de l’e-démocratie et de l’e-gouvernement existant. La Démocratie Internet consiste à cerner la représentation démocratique de telle manière qu’elle puisse être opérationn
APA, Harvard, Vancouver, ISO, and other styles
13

Lichtner, Kurt. "A framework for machine-assisted software architecture validation." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0018/NQ56675.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Lundström, Robin. "Machine Learning for Air Flow Characterization : An application of Theory-Guided Data Science for Air Fow characterization in an Industrial Foundry." Thesis, Karlstads universitet, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-72782.

Full text
Abstract:
In industrial environments, operators are exposed to polluted air which after constant exposure can cause irreversible lethal diseases such as lung cancer. The current air monitoring techniques are carried out sparely in either a single day annually or at few measurement positions for a few days.In this thesis a theory-guided data science (TGDS) model is presented. This hybrid model combines a steady state Computational Fluid Dynamics (CFD) model with a machine learning model. Both the CFD model and the machine learning algorithm was developed in Matlab. The CFD model serves as a basis for the
APA, Harvard, Vancouver, ISO, and other styles
15

Emele, Chukwuemeka David. "Informing dialogue strategy through argumentation-derived evidence." Thesis, University of Aberdeen, 2011. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=179453.

Full text
Abstract:
In many settings, agents engage in problem-solving activities, which require them to share resources, act on each others behalf, coordinate individual acts, etc. If autonomous agents are to e ectively interact (or support interaction among humans) in situations such as deciding whom and how to approach the provision of a resource or the performance of an action, there are a number of important questions to address. Who do I choose to delegate a task to? What do I need to say to convince him/her to do something? Were similar requests granted from similar agents in similar circumstances? What ar
APA, Harvard, Vancouver, ISO, and other styles
16

Ryabko, Daniil. "APPRENABILITÉ DANS LES PROBLÈMES DE L'INFÉRENCE SÉQUENTIELLE." Habilitation à diriger des recherches, Université des Sciences et Technologie de Lille - Lille I, 2011. http://tel.archives-ouvertes.fr/tel-00675680.

Full text
Abstract:
Les travaux présentés sont dédiés à la possibilité de faire de l'inférence statistique à partir de données séquentielles. Le problème est le suivant. Étant donnée une suite d'observations x_1,...,x_n,..., on cherche à faire de l'inférence sur le processus aléatoire ayant produit la suite. Plusieurs problèmes, qui d'ailleurs ont des applications multiples dans différents domaines des mathématiques et de l'informatique, peuvent être formulés ainsi. Par exemple, on peut vouloir prédire la probabilité d'apparition de l'observation suivante, x_{n+1} (le problème de prédiction séquentielle); ou répo
APA, Harvard, Vancouver, ISO, and other styles
17

Crocker, Matthew Walter. "A principle-based system for natural language analysis and translation." Thesis, University of British Columbia, 1988. http://hdl.handle.net/2429/27863.

Full text
Abstract:
Traditional views of grammatical theory hold that languages are characterised by sets of constructions. This approach entails the enumeration of all possible constructions for each language being described. Current theories of transformational generative grammar have established an alternative position. Specifically, Chomsky's Government-Binding theory proposes a system of principles which are common to human language. Such a theory is referred to as a "Universal Grammar"(UG). Associated with the principles of grammar are parameters of variation which account for the diversity of human languag
APA, Harvard, Vancouver, ISO, and other styles
18

Sabah, Quentin. "SIAAM: Isolation dynamique pour une machine abstraite à base d'acteurs." Phd thesis, Université de Grenoble, 2013. http://tel.archives-ouvertes.fr/tel-00933072.

Full text
Abstract:
Dans cette thèse nous étudions l'isolation mémoire et les mesures de communications efficaces par passage de message dans le contexte des environnements à mémoire partagée et la programmation orientée-objets. L'état de l'art en la matière se base presque exclusivement sur deux techniques complémentaires dites de propriété des objets (ownership) et d'unicité de références (reference uniqueness) afin d'adresser les problèmes de sécurité dans les programmes concurrents. Il est frappant de constater que la grande majorité des travaux existants emploient des méthodes de vérification statique des pr
APA, Harvard, Vancouver, ISO, and other styles
19

Cai, Zhiyuan. "Global Mohorovicic Discontinuity Estimates Based on Isostatic Theories Using Gravity Data and Seismic Models." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu159455139426099.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Banda, Brandon Mathewe. "General Game Playing as a Bandit-Arms Problem: A Multiagent Monte-Carlo Solution Exploiting Nash Equilibria." Oberlin College Honors Theses / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1559142912626158.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Wang, Jiayuan. "Algorithms for Guaranteed Denoising of Data and Their Applications." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1577966043088083.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Yu, Shen. "A Bayesian machine learning system for recognizing group behaviour." Thesis, McGill University, 2009. http://digitool.Library.McGill.CA:8881/R/?func=dbin-jump-full&object_id=32565.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Brückner, Michael. "Prediction games : machine learning in the presence of an adversary." Phd thesis, Universität Potsdam, 2012. http://opus.kobv.de/ubp/volltexte/2012/6037/.

Full text
Abstract:
In many applications one is faced with the problem of inferring some functional relation between input and output variables from given data. Consider, for instance, the task of email spam filtering where one seeks to find a model which automatically assigns new, previously unseen emails to class spam or non-spam. Building such a predictive model based on observed training inputs (e.g., emails) with corresponding outputs (e.g., spam labels) is a major goal of machine learning. Many learning methods assume that these training data are governed by the same distribution as the test data which th
APA, Harvard, Vancouver, ISO, and other styles
24

Van, Delden Sebastian Alexander. "Larger-first partial parsing." Doctoral diss., University of Central Florida, 2003. http://digital.library.ucf.edu/cdm/ref/collection/RTD/id/2038.

Full text
Abstract:
University of Central Florida College of Engineering Thesis<br>Larger-first partial parsing is a primarily top-down approach to partial parsing that is opposite to current easy-fzrst, or primarily bottom-up, strategies. A rich partial tree structure is captured by an algorithm that assigns a hierarchy of structural tags to each of the input tokens in a sentence. Part-of-speech tags are first assigned to the words in a sentence by a part-of-speech tagger. A cascade of Deterministic Finite State Automata then uses this part-of-speech information to identify syntactic relations primarily in a des
APA, Harvard, Vancouver, ISO, and other styles
25

Verbancsics, Phillip. "Effective task transfer through indirect encoding." Doctoral diss., University of Central Florida, 2011. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4716.

Full text
Abstract:
An important goal for machine learning is to transfer knowledge between tasks. For example, learning to play RoboCup Keepaway should contribute to learning the full game of RoboCup soccer. Often approaches to task transfer focus on transforming the original representation to fit the new task. Such representational transformations are necessary because the target task often requires new state information that was not included in the original representation. In RoboCup Keepaway, changing from the 3 vs. 2 variant of the task to 4 vs. 3 adds state information for each of the new players. In contra
APA, Harvard, Vancouver, ISO, and other styles
26

Myers, James William. "Stochastic algorithms for learning with incomplete data an application to Bayesian networks /." Full text available online (restricted access), 1999. http://images.lib.monash.edu.au/ts/theses/Myers.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Weninger, Timothy Edwards. "Link discovery in very large graphs by constructive induction using genetic programming." Thesis, Manhattan, Kan. : Kansas State University, 2008. http://hdl.handle.net/2097/1087.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Doran, Gary Brian Jr. "Multiple-Instance Learning from Distributions." Case Western Reserve University School of Graduate Studies / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=case1417736923.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Ewö, Christian. "A machine learning approach in financial markets." Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik och datavetenskap, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5571.

Full text
Abstract:
In this work we compare the prediction performance of three optimized technical indicators with a Support Vector Machine Neural Network. For the indicator part we picked the common used indicators: Relative Strength Index, Moving Average Convergence Divergence and Stochastic Oscillator. For the Support Vector Machine we used a radial-basis kernel function and regression mode. The techniques were applied on financial time series brought from the Swedish stock market. The comparison and the promising results should be of interest for both finance people using the techniques in practice, as well
APA, Harvard, Vancouver, ISO, and other styles
30

Mersin, Serhan. "A Hypercomputational Approach To The Agent Causation Theory Of Free Will." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607148/index.pdf.

Full text
Abstract:
Hypercomputation, which is the general concept embracing all machinery capable of carrying out more tasks than Turing Machines and beyond the Turing Limit, has implications for various fields including mathematics, physics, computer science and philosophy. Regarding its philosophical aspects, it is necessary to reveal the position of hypercomputation relative to the classical computational theory of mind in order to clarify and broaden the scope of hypercomputation so that it encompasses some phenomena which are regarded as problematic because of their property of being uncomp
APA, Harvard, Vancouver, ISO, and other styles
31

Eamrurksiri, Araya. "Applying Machine Learning to LTE/5G Performance Trend Analysis." Thesis, Linköpings universitet, Statistik och maskininlärning, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-139126.

Full text
Abstract:
The core idea of this thesis is to reduce the workload of manual inspection when the performance analysis of an updated software is required. The Central Process- ing Unit (CPU) utilization, which is one of the essential factors for evaluating the performance, is analyzed. The purpose of this work is to apply machine learning techniques that are suitable for detecting the state of the CPU utilization and any changes in the test environment that affects the CPU utilization. The detection re- lies on a Markov switching model to identify structural changes, which are assumed to follow an unobserv
APA, Harvard, Vancouver, ISO, and other styles
32

Hazarika, Subhashis. "Statistical and Machine Learning Approaches For Visualizing and Analyzing Large-Scale Simulation Data." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1574692702479196.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

LAGRÉE, PAUL. "Crowdsourcing public transport data via livemobile tracking : Feasibility study of a system capable of collecting mobile data to build a database ofpublic transit routes, stops and timetables, using machine learning techniques andgraph theory." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-153677.

Full text
Abstract:
Millions of people use public transport systems everywhere in the world, while the number of smartphones connected to the Internet is dramatically increasing. The aim of this thesis is to study, design, and prototype a system to collect data from the mobile devices of regular public transport users and analyse them in order to provide useful information to travellers all over the world. To study the feasibility of this project at a large scale, data will be created to simulate what will be collected via mobile phone applications. The main objective of this paper is to study the effect of data
APA, Harvard, Vancouver, ISO, and other styles
34

Gao, Xi. "Graph-based Regularization in Machine Learning: Discovering Driver Modules in Biological Networks." VCU Scholars Compass, 2015. http://scholarscompass.vcu.edu/etd/3942.

Full text
Abstract:
Curiosity of human nature drives us to explore the origins of what makes each of us different. From ancient legends and mythology, Mendel's law, Punnett square to modern genetic research, we carry on this old but eternal question. Thanks to technological revolution, today's scientists try to answer this question using easily measurable gene expression and other profiling data. However, the exploration can easily get lost in the data of growing volume, dimension, noise and complexity. This dissertation is aimed at developing new machine learning methods that take data from different classes as
APA, Harvard, Vancouver, ISO, and other styles
35

Lasrado, Vernet Michael. "Design of the layout of a manufacturing facility with a closed loop conveyor with shortcuts using queueing theory and genetic algorithms." Doctoral diss., University of Central Florida, 2011. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4783.

Full text
Abstract:
With the ongoing technology battles and price wars in today's competitive economy, every company is looking for an advantage over its peers. A particular choice of facility layout can have a significant impact on the ability of a company to maintain lower operational expenses under uncertain economic conditions. It is known that systems with less congestion have lower operational costs. Traditionally, manufacturing facility layout problem methods aim at minimizing the total distance traveled, the material handling cost, or the time in the system (based on distance traveled at a specific speed)
APA, Harvard, Vancouver, ISO, and other styles
36

Zomlot, Loai M. M. "Handling uncertainty in intrusion analysis." Diss., Kansas State University, 2014. http://hdl.handle.net/2097/17603.

Full text
Abstract:
Doctor of Philosophy<br>Department of Computing and Information Sciences<br>Xinming Ou<br>Intrusion analysis, i.e., the process of combing through Intrusion Detection System (IDS) alerts and audit logs to identify true successful and attempted attacks, remains a difficult problem in practical network security defense. The primary cause of this problem is the high false positive rate in IDS system sensors used to detect malicious activity. This high false positive rate is attributed to an inability to differentiate nearly certain attacks from those that are merely possible. This inefficacy has
APA, Harvard, Vancouver, ISO, and other styles
37

Sepp, Löfgren Nicholas. "Accelerating bulk material property prediction using machine learning potentials for molecular dynamics : predicting physical properties of bulk Aluminium and Silicon." Thesis, Linköpings universitet, Teoretisk Fysik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-179894.

Full text
Abstract:
In this project machine learning (ML) interatomic potentials are trained and used in molecular dynamics (MD) simulations to predict the physical properties of total energy, mean squared displacement (MSD) and specific heat capacity for systems of bulk Aluminium and Silicon. The interatomic potentials investigated are potentials trained using the ML models kernel ridge regression (KRR) and moment tensor potentials (MTPs). The simulations using these ML potentials are then compared with results obtained from ab-initio simulations using the gold standard method of density functional theory (DFT),
APA, Harvard, Vancouver, ISO, and other styles
38

Pham, Thi. "Visualization and Classification of Neurological Status with Tensor Decomposition and Machine Learning." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-158497.

Full text
Abstract:
Recognition of physical and mental responses to stress is important for stress assessment and management as its negative effects in health can be prevented or reduced. Wearable technology, mainly using electroencephalogram (EEG), provides information such as tracking fitness activity, disease detection, and monitoring neurologicalstates of individuals. However, the recording of EEG signals from a wearable device is inconvenient, expensive, and uncomfortable during normal daily activities. This study introduces the application of tensor decomposition of non-EEG data for visualizing and classify
APA, Harvard, Vancouver, ISO, and other styles
39

Abu-halaweh, Nael Mohammed. "Integrating Information Theory Measures and a Novel Rule-Set-Reduction Tech-nique to Improve Fuzzy Decision Tree Induction Algorithms." Digital Archive @ GSU, 2009. http://digitalarchive.gsu.edu/cs_diss/48.

Full text
Abstract:
Machine learning approaches have been successfully applied to many classification and prediction problems. One of the most popular machine learning approaches is decision trees. A main advantage of decision trees is the clarity of the decision model they produce. The ID3 algorithm proposed by Quinlan forms the basis for many of the decision trees’ application. Trees produced by ID3 are sensitive to small perturbations in training data. To overcome this problem and to handle data uncertainties and spurious precision in data, fuzzy ID3 integrated fuzzy set theory and ideas from fuzzy logic with
APA, Harvard, Vancouver, ISO, and other styles
40

Machart, Pierre. "Coping with the Computational and Statistical Bipolar Nature of Machine Learning." Phd thesis, Aix-Marseille Université, 2012. http://tel.archives-ouvertes.fr/tel-00771718.

Full text
Abstract:
L'Apprentissage Automatique tire ses racines d'un large champ disciplinaire qui inclut l'Intelligence Artificielle, la Reconnaissance de Formes, les Statistiques ou l'Optimisation. Dès les origines de l'Apprentissage, les questions computationelles et les propriétés en généralisation ont toutes deux été identifiées comme centrales pour la discipline. Tandis que les premières concernent les questions de calculabilité ou de complexité (sur un plan fondamental) ou d'efficacité computationelle (d'un point de vue plus pratique) des systèmes d'apprentissage, les secondes visent a comprendre et carac
APA, Harvard, Vancouver, ISO, and other styles
41

Tadonki, Claude. "High Performance Computing as a Combination of Machines and Methods and Programming." Habilitation à diriger des recherches, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00832930.

Full text
Abstract:
High Performance Computing (HPC) aims at providing reasonably fast computing solutions to both scientific and real life technical problems. Many efforts have indeed been made on the way to powerful supercomputers, both generic and customized configurations. However, whatever their current and future breathtaking capabilities, supercomputers work by brute force and deterministic steps, while human mind works by few strokes of brilliance. Thus, in order to take a significant advantage of hardware advances, we need powerful methods to solve problems together with highly skillful programming effor
APA, Harvard, Vancouver, ISO, and other styles
42

Mahmod, Shad. "Deinterleaving pulse trains with DBSCAN and FART." Thesis, Uppsala universitet, Avdelningen för systemteknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-379718.

Full text
Abstract:
Studying radar pulses and looking for certain patterns is critical in order to assess the threat level of the environment around an antenna. In order to study the electromagnetic pulses emitted from a certain radar, one must first register and identify these pulses. Usually there are several active transmitters in anenvironment and an antenna will register pulses from various sources. In order to study the different pulse trains, the registered pulses first have to be sorted sothat all pulses that are transmitted from one source are grouped together. This project aims to solve this problem, us
APA, Harvard, Vancouver, ISO, and other styles
43

Couetoux, Adrien. "Monte Carlo Tree Search pour les problèmes de décision séquentielle en milieu continus et stochastiques." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00927252.

Full text
Abstract:
Dans cette thèse, nous avons étudié les problèmes de décisions séquentielles, avec comme application la gestion de stocks d'énergie. Traditionnellement, ces problèmes sont résolus par programmation dynamique stochastique. Mais la grande dimension, et la non convexité du problème, amènent à faire des simplifications sur le modèle pour pouvoir faire fonctionner ces méthodes. Nous avons donc étudié une méthode alternative, qui ne requiert pas de simplifications du modèle: Monte Carlo Tree Search (MCTS). Nous avons commencé par étendre le MCTS classique (qui s'applique aux domaines finis et déterm
APA, Harvard, Vancouver, ISO, and other styles
44

Vurkaç, Mehmet. "Prestructuring Multilayer Perceptrons based on Information-Theoretic Modeling of a Partido-Alto-based Grammar for Afro-Brazilian Music: Enhanced Generalization and Principles of Parsimony, including an Investigation of Statistical Paradigms." PDXScholar, 2011. https://pdxscholar.library.pdx.edu/open_access_etds/384.

Full text
Abstract:
The present study shows that prestructuring based on domain knowledge leads to statistically significant generalization-performance improvement in artificial neural networks (NNs) of the multilayer perceptron (MLP) type, specifically in the case of a noisy real-world problem with numerous interacting variables. The prestructuring of MLPs based on knowledge of the structure of a problem domain has previously been shown to improve generalization performance. However, the problem domains for those demonstrations suffered from significant shortcomings: 1) They were purely logical problems, and 2)
APA, Harvard, Vancouver, ISO, and other styles
45

Coursey, Kino High. "An Approach Towards Self-Supervised Classification Using Cyc." Thesis, University of North Texas, 2006. https://digital.library.unt.edu/ark:/67531/metadc5470/.

Full text
Abstract:
Due to the long duration required to perform manual knowledge entry by human knowledge engineers it is desirable to find methods to automatically acquire knowledge about the world by accessing online information. In this work I examine using the Cyc ontology to guide the creation of Naïve Bayes classifiers to provide knowledge about items described in Wikipedia articles. Given an initial set of Wikipedia articles the system uses the ontology to create positive and negative training sets for the classifiers in each category. The order in which classifiers are generated and used to test articles
APA, Harvard, Vancouver, ISO, and other styles
46

Lagarde, Matthieu, Philippe Gaussier, and Pierre Andry. "Apprentissage de nouveaux comportements: vers le développement épigénétique d'un robot autonome." Phd thesis, Université de Cergy Pontoise, 2010. http://tel.archives-ouvertes.fr/tel-00749761.

Full text
Abstract:
La problématique de l'apprentissage de comportements sur un robot autonome soulève de nombreuses questions liées au contrôle moteur, à l'encodage du comportement, aux stratégies comportementales et à la sélection de l'action. Utiliser une approche développementale présente un intérêt tout particulier dans le cadre de la robotique autonome. Le comportement du robot repose sur des mécanismes de bas niveau dont les interactions permettent de faire émerger des comportements plus complexes. Le robot ne possède pas d'informations a priori sur ses caractéristiques physiques ou sur l'environnement, il
APA, Harvard, Vancouver, ISO, and other styles
47

Lima, Clodoaldo Aparecido de Moraes. "Comite de maquinas : uma abordagem unificada empregando maquinas de vetores-suporte." [s.n.], 2004. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261258.

Full text
Abstract:
Orientador : Fernando Jose Von Zuben<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-08-04T02:17:19Z (GMT). No. of bitstreams: 1 Lima_ClodoaldoAparecidodeMoraes_D.pdf: 5444612 bytes, checksum: 0172ca4143c2737bf19a3b2076c06b44 (MD5) Previous issue date: 2004<br>Resumo: Os algoritmos baseados em métodos de kernel destacam-se entre as diversas técnicas de aprendizado de máquina. Eles foram inicialmente empregados na implementação de máquinas de vetores-suporte (SVMs). A abordagem SVM representa um proc
APA, Harvard, Vancouver, ISO, and other styles
48

Hosini, Rebin. "Detection of high-risk shops in e- commerce." Thesis, Linköpings universitet, Statistik och maskininlärning, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-150191.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Elkin, Colin P. "Development of Adaptive Computational Algorithms for Manned and Unmanned Flight Safety." University of Toledo / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1544640516618623.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Maubert, Bastien. "Fondations logiques des jeux à information imparfaite : stratégies uniformes." Phd thesis, Université Rennes 1, 2014. http://tel.archives-ouvertes.fr/tel-00980490.

Full text
Abstract:
On trouve dans la littérature de nombreux exemples de jeux où les stratégies souhaitées sont soumises à des contraintes ''transversales'' portant sur des ensembles de parties, reliées entre elles par quelque relation sémantique. L'exemple le plus fameux est celui des stratégies dans les jeux à information imparfaite, et les jeux où la condition de gain a un aspect épistémique en sont d'autres. Cependant, aucune étude approfondie n'a à notre connaissance été menée sur ce type de contraintes dans leur généralité. C'est ce que nous nous proposons de commencer dans cette thèse. Nous définissons don
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!