Zaloguj się

Gotowe bibliografie tematyczne / Approximate logics / Rozprawy doktorskie

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Approximate logics.

Rozprawy doktorskie na temat „Approximate logics”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 1 lutego 2022

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 27 najlepszych rozpraw doktorskich naukowych na temat „Approximate logics”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.

1

Rajaratnam, David Computer Science &amp Engineering Faculty of Engineering UNSW. "Logical approximation and compilation for resource-bounded reasoning." Publisher:University of New South Wales. Computer Science & Engineering, 2008. http://handle.unsw.edu.au/1959.4/41296.

Pełny tekst źródła

Streszczenie:

Providing a logical characterisation of rational agent reasoning has been a long standing challenge in artificial intelligence (AI) research. It is a challenge that is not only of interest for the construction of AI agents, but is of equal importance in the modelling of agent behaviour. The goal of this thesis is to contribute to the formalisation of agent reasoning by showing that the computational limitations of agents is a vital component of modelling rational behaviour. To achieve this aim, both motivational and formal aspects of resource-bounded agents are examined. It is a central argum

Style APA, Harvard, Vancouver, ISO itp.

2

Fernández, Gil Oliver. "Adding Threshold Concepts to the Description Logic EL." Doctoral thesis, Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-204523.

Pełny tekst źródła

Streszczenie:

We introduce a family of logics extending the lightweight Description Logic EL, that allows us to define concepts in an approximate way. The main idea is to use a graded membership function m, which for each individual and concept yields a number in the interval [0,1] expressing the degree to which the individual belongs to the concept. Threshold concepts C~t for ~ in {<,<=,>,>=} then collect all the individuals that belong to C with degree ~t. We further study this framework in two particular directions. First, we define a specific graded membership function deg and investigate the complexity

Style APA, Harvard, Vancouver, ISO itp.

3

Carbin, Michael (Michael James). "Logical reasoning for approximate and unreliable computation." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99813.

Pełny tekst źródła

Streszczenie:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 343-350).<br>Improving program performance and resilience are long-standing goals. Traditional approaches include a variety of transformation, compilation, and runtime techniques that share the common property that the resulting program has the same semantics as the original program. However, researchers have recently proposed a variety of new techniques that set aside this traditional rest

Style APA, Harvard, Vancouver, ISO itp.

4

Weydert, Emil. "How to approximate the naive comprehension scheme inside of classical logic." Bonn : [s.n.], 1989. http://catalog.hathitrust.org/api/volumes/oclc/19990751.html.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Taleb-Bendiab, Azzelarabe. "Logic programming for conceptual engineering design : selection process by approximate matching." Thesis, University of Liverpool, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.316548.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Perundurai, Rajasekaran Siddharthan. "Nonparametric Inverse Reinforcement Learning and Approximate Optimal Control with Temporal Logic Tasks." Digital WPI, 2017. https://digitalcommons.wpi.edu/etd-theses/1205.

Pełny tekst źródła

Streszczenie:

"This thesis focuses on two key problems in reinforcement learning: How to design reward functions to obtain intended behaviors in autonomous systems using the learning-based control? Given complex mission specification, how to shape the reward function to achieve fast convergence and reduce sample complexity while learning the optimal policy? To answer these questions, the first part of this thesis investigates inverse reinforcement learning (IRL) method with a purpose of learning a reward function from expert demonstrations. However, existing algorithms often assume that the expert demon

Style APA, Harvard, Vancouver, ISO itp.

7

Martins, Mayler Gama Alvarenga. "Applications of functional composition for CMOS and emerging technologies." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2015. http://hdl.handle.net/10183/164452.

Pełny tekst źródła

Streszczenie:

Os avanços da indústria de semicondutores nas últimas décadas foram baseados fortemente na contínua redução de tamanho dos dispositivos CMOS fabricados. Os usos de dispositivos CMOS dependem profundamente da lógica de portas E/OU/INV. À medida que os dispositivos CMOS estão atingindo oslimites fisicos, pesquisadores aumento esforço para prolongar a vida útil da tecnologia CMOS. Também é necessário investigar dispositivos alternativos, que em muitos casos implicam no uso de operações lógicas básicas diferentes. Como as ferramentas comerciais de síntese não são capazes de manipular eficientement

Style APA, Harvard, Vancouver, ISO itp.

8

Chaoued, Nouha. "Représentation et traitement des connaissances en logique multivalente : cas d'une répartition non uniforme des degrés de vérité." Thesis, Montpellier, 2017. http://www.theses.fr/2017MONTS048/document.

Pełny tekst źródła

Streszczenie:

Dans la plupart des activités quotidiennes, l’Homme a tendance à utiliser des connaissances imparfaites. L’imperfection se rapporte à trois volets : l’imprécision, l’incertitude et l’incomplétude. Nous thèse concerne les connaissances imprécises. En particulier, nous nous intéressons au traitement qualitatif de l’information imprécise dans les systèmes à base de connaissances. Diverses approches ont été proposées pour traiter les connaissances imprécises, en particulier, la logique floue et la logique multivalente. Les théories des ensembles flous et des multi-ensembles sont un moyen très appr

Style APA, Harvard, Vancouver, ISO itp.

9

Huster, Todd. "OWL query answering using machine learning." Wright State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=wright1446117806.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Dena, Ornelas Oscar S. "Fast approximate migration of ground penetrating radar using Kalman estimators and determination of the lithospheric structure of Lake Baikal, Russia." To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2008. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Cyriac, Aiswarya. "Verification of communicating recursive programs via split-width." Thesis, Cachan, Ecole normale supérieure, 2014. http://www.theses.fr/2014DENS0004/document.

Pełny tekst źródła

Streszczenie:

Cette thèse développe des techniques à base d'automates pour la vérification formelle de systèmes physiquement distribués communiquant via des canaux fiables de tailles non bornées. Chaque machine peut exécuter localement plusieurs programmes récursifs (multi-threading). Un programme récursif peut également utiliser pour ses calculs locaux des structures de données non bornées, comme des files ou des piles. Ces systèmes, utilisés en pratique, sont si puissants que tous leurs problèmes de vérification deviennent indécidables. Nous introduisons et étudions un nouveau paramètre, appelé largeur de

Style APA, Harvard, Vancouver, ISO itp.

12

Croft, David. "Semi-automated co-reference identification in digital humanities collections." Thesis, De Montfort University, 2014. http://hdl.handle.net/2086/10491.

Pełny tekst źródła

Streszczenie:

Locating specific information within museum collections represents a significant challenge for collection users. Even when the collections and catalogues exist in a searchable digital format, formatting differences and the imprecise nature of the information to be searched mean that information can be recorded in a large number of different ways. This variation exists not just between different collections, but also within individual ones. This means that traditional information retrieval techniques are badly suited to the challenges of locating particular information in digital humanities col

Style APA, Harvard, Vancouver, ISO itp.

13

Hrbáček, Radek. "Automatický multikriteriální paralelní evoluční návrh a aproximace obvodů." Doctoral thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-412591.

Pełny tekst źródła

Streszczenie:

Spotřeba a energetická efektivita se stává jedním z nejdůležitějších parametrů při návrhu počítačových systémů, zejména kvůli omezené kapacitě napájení u zařízení napájených bateriemi a velmi vysoké spotřebě energie rostoucích datacenter a cloudové infrastruktury. Současně jsou uživatelé ochotni do určité míry tolerovat nepřesné nebo chybné výpočty v roustoucím počtu aplikací díky nedokonalostem lidských smyslů, statistické povaze výpočtů, šumu ve vstupních datech apod. Přibližné počítání, nová oblast výzkumu v počítačovém inženýrství, využívá rozvolnění požadavků na funkčnost za účelem zvýšen

Style APA, Harvard, Vancouver, ISO itp.

14

Cyriac, Aiswarya, and Aiswarya Cyriac. "Verification of communicating recursive programs via split-width." Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2014. http://tel.archives-ouvertes.fr/tel-01015561.

Pełny tekst źródła

Streszczenie:

This thesis investigates automata-theoretic techniques for the verification of physically distributed machines communicating via unbounded reliable channels. Each of these machines may run several recursive programs (multi-threading). A recursive program may also use several unbounded stack and queue data-structures for its local-computation needs. Such real-world systems are so powerful that all verification problems become undecidable. We introduce and study a new parameter called split-width for the under-approximate analysis of such systems. Split-width is the minimum number of splits requ

Style APA, Harvard, Vancouver, ISO itp.

15

Mrázek, Vojtěch. "Metodologie pro automatický návrh nízkopříkonových aproximativních obvodů." Doctoral thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2018. http://www.nusl.cz/ntk/nusl-412599.

Pełny tekst źródła

Streszczenie:

Rozšiřování moderních vestavěných a mobilních systémů napájených bateriemi zvyšuje požadavky na návrh těchto systémů s ohledem na příkon. Přestože moderní návrhové techniky optimalizují příkon, elektrická spotřeba těchto obvodů stále roste díky jejich složitosti. Nicméně existuje celá řada aplikací, kde nepotřebujeme získat úplně přesný výstup. Díky tomu se objevuje technika zvaná aproximativní (přibližné) počítání, která umožňuje za cenu zanesení malé chyby do výpočtu významně redukovat příkon obvodů. V práci se zaměřujeme na použití evolučních algoritmů v této oblasti. Ačkoliv již tyto algor

Style APA, Harvard, Vancouver, ISO itp.

16

Vigneron, Laurent. "Déduction automatique appliquée à l'analyse et la vérification de systèmes infinis." Habilitation à diriger des recherches, Université Nancy II, 2011. http://tel.archives-ouvertes.fr/tel-00642467.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Ling, Hong. "Implementation of Stochastic Neural Networks for Approximating Random Processes." Master's thesis, Lincoln University. Environment, Society and Design Division, 2007. http://theses.lincoln.ac.nz/public/adt-NZLIU20080108.124352/.

Pełny tekst źródła

Streszczenie:

Artificial Neural Networks (ANNs) can be viewed as a mathematical model to simulate natural and biological systems on the basis of mimicking the information processing methods in the human brain. The capability of current ANNs only focuses on approximating arbitrary deterministic input-output mappings. However, these ANNs do not adequately represent the variability which is observed in the systems natural settings as well as capture the complexity of the whole system behaviour. This thesis addresses the development of a new class of neural networks called Stochastic Neural Networks (SNNs) in

Style APA, Harvard, Vancouver, ISO itp.

18

Gilon, Odile. "Essentia indifferens: études sur l'antériorité, l'homogénéité et l'unité dans la métaphysique de Jean Duns Scot." Doctoral thesis, Universite Libre de Bruxelles, 2009. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210227.

Pełny tekst źródła

Streszczenie:

Ce travail porte sur l'application et l'utilisation par Jean Duns Scot de la théorie de l'indifférence de l'essence, issue du péripatétisme arabe, et se donne pour enjeu d'en comprendre le fonctionnement conceptuel. Solution conjointe aux questions de la constitution ontologique des choses, des rapports entre le langage et la réalité et du mode d'appréhension des notions générales dans l'abstraction, la théorie de l'indifférence de l'essence sert de sous-bassement à la métaphysique de Duns Scot. C'est au moyen de cette théorie qu'il est possible, comme le montre cette recherche, de relire cert

Style APA, Harvard, Vancouver, ISO itp.

19

Marantidis, Pavlos. "Quantitative Variants of Language Equations and their Applications to Description Logics." Doctoral thesis, 2019. https://tud.qucosa.de/id/qucosa%3A35639.

Pełny tekst źródła

Streszczenie:

Unification in description logics (DLs) has been introduced as a novel inference service that can be used to detect redundancies in ontologies, by finding different concepts that may potentially stand for the same intuitive notion. Together with the special case of matching, they were first investigated in detail for the DL FL0, where these problems can be reduced to solving certain language equations. In this thesis, we extend this service in two directions. In order to increase the recall of this method for finding redundancies, we introduce and investigate the notion of approximate unificat

Style APA, Harvard, Vancouver, ISO itp.

20

Choudhury, Mihir Rajanikant. "Approximate logic circuits: Theory and applications." Thesis, 2011. http://hdl.handle.net/1911/64404.

Pełny tekst źródła

Streszczenie:

CMOS technology scaling, the process of shrinking transistor dimensions based on Moore's law, has been the thrust behind increasingly powerful integrated circuits for over half a century. As dimensions are scaled to few tens of nanometers, process and environmental variations can significantly alter transistor characteristics, thus degrading reliability and reducing performance gains in CMOS designs with technology scaling. Although design solutions proposed in recent years to improve reliability of CMOS designs are power-efficient, the performance penalty associated with these solutions furth

Style APA, Harvard, Vancouver, ISO itp.

21

Chiu-Ming, Lung. "Approximate Matching of Web Services with Description Logic Reasoning." 2005. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-2206200517412500.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

Lung, Chiu-Ming, and 龍秋明. "Approximate Matching of Web Services with Description Logic Reasoning." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/09729760246206817914.

Pełny tekst źródła

Streszczenie:

碩士<br>國立臺灣大學<br>資訊管理學研究所<br>93<br>Heterogeneous Internet applications can be easily integrated when they are exported as Web Services, which use XML-based standards for service description and communication. It becomes possible to provide more sophisticated compound services by combining simpler services. This entails, among other things, the need of precise semantic description of service demands and supplies and an associated matching mechanism. Technologies under development in the Semantic Web, in particular ontology and rule definition languages, appear to meet the need perfectly. However

Style APA, Harvard, Vancouver, ISO itp.

23

Miao, Jin. "Modeling and synthesis of approximate digital circuits." Thesis, 2014. http://hdl.handle.net/2152/28060.

Pełny tekst źródła

Streszczenie:

Energy minimization has become an ever more important concern in the design of very large scale integrated circuits (VLSI). In recent years, approximate computing, which is based on the idea of trading off computational accuracy for improved energy efficiency, has attracted significant attention. Applications that are both compute-intensive and error-tolerant are most suitable to adopt approximation strategies. This includes digital signal processing, data mining, machine learning or search algorithms. Such approximations can be achieved at several design levels, ranging from software, algori

Style APA, Harvard, Vancouver, ISO itp.

24

Lai, Yung-An, and 賴勇安. "Synthesis of Approximate Threshold Logic Circuits with an Error Rate Guarantee." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/xv3937.

Pełny tekst źródła

Streszczenie:

碩士<br>國立清華大學<br>資訊工程學系所<br>105<br>Recently, threshold logic attracts a lot of attention due to the advances of its physical implementation and the strong binding to neural networks.On the other hand, approximate computing is a new design paradigm that focuses on error-tolerant applications, e.g., machine learning or pattern recognition.In this thesis, we integrate threshold logic with approximate computing and propose a synthesis algorithm to obtain cost-efficient approximate threshold logic circuits with an error rate guarantee.We conduct experiments on a set of IWLS 2005 benchmarks.The exper

Style APA, Harvard, Vancouver, ISO itp.

25

Tsai, Chia-Lu, and 蔡佳旅. "Lock or Luck: Robust Logic Locking for Deep-Learning Applications Using Approximate Arithmetic." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/7rqyx8.

Pełny tekst źródła

Streszczenie:

碩士<br>國立交通大學<br>資訊科學與工程研究所<br>108<br>Due to increasing complexity of hardware design and manufacturing, the designers and foundries of integrated circuits (ICs) are usually distributed worldwide. As the IC supply chain spans multiple countries, security concerns have become a major challenge to the semiconductor industry. Logic locking is a technique to protect an IC design from over-production and unauthorized use by untrusted foundries. But the conventional logic locking schemes are not secure enough when applied to approximate arithmetic circuits, since the circuits are error-tolerant. In t

Style APA, Harvard, Vancouver, ISO itp.

26

林俞丞. "The Use of Approximate High-Level Information in a Fuzzy Logic Based TORCS Simulated Car Controller." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/74307404501616068050.

Pełny tekst źródła

Streszczenie:

碩士<br>國立交通大學<br>多媒體工程研究所<br>100<br>The main idea of thesis is that by using high-level information implemented by fuzzy logic based simulated car controller. The artificial of intelligence of controller can make proper decision or reaction based on the high-level information. The high-level information obtained by sensor detecting the distance between car and track, the fuzzy system transform this information into distance from the corner and the sharpness of the corner, then the controller planning to drive with the target speed and the proper position.

Style APA, Harvard, Vancouver, ISO itp.

27

Shen, Kai Ming, and 沈凱明. "Exploring Resilient Properties of Machine Learning on Approximate Memory." Thesis, 2019. http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22107CGU05392017%22.&searchmode=basic.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!