Einloggen

Thematische Bibliographien / Complexity / Dissertationen

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Complexity.

Dissertationen zum Thema „Complexity“

Autor: Grafiati

Veröffentlicht am 4. Juni 2021

Zuletzt aktualisiert am 25. Juli 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Complexity" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Baumler, Raphaël. "La sécurité de marché et son modèle maritime : entre dynamiques du risque et complexité des parades : les difficultés pour construire la sécurité." Thesis, Evry-Val d'Essonne, 2009. http://www.theses.fr/2009EVRY0024/document.

Der volle Inhalt der Quelle

Annotation:

Modèles de développement, capitalisme et industrialisme sont de grandes dynamiques du risque par leur capacité à transformer le social. Au niveau des firmes, l’innovation continue et la concurrence obligent à l’ajustement permanent. Soumises aux propriétaires, les firmes se focalisent sur le risque financier. Les autres risques lui sont subordonnés. Les dynamiques internes du risque évoluent au rythme d’impératifs externes. La compétition justifie réductions de coûts et réorganisations déstabilisantes. La sécurité a pour objectif la limitation des conditions de réalisation des risques. Constru

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Rubiano, Thomas. "Implicit Computational Complexity and Compilers." Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCD076/document.

Der volle Inhalt der Quelle

Annotation:

Complexity theory helps us predict and control resources, usually time and space, consumed by programs. Static analysis on specific syntactic criterion allows us to categorize some programs. A common approach is to observe the program’s data’s behavior. For instance, the detection of non-size-increasing programs is based on a simple principle : counting memory allocation and deallocation, particularly in loops. This way, we can detect programs which compute within a constant amount of space. This method can easily be expressed as property on control flow graphs. Because analyses on data’s beha

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Pankratov, Denis. "Communication complexity and information complexity." Thesis, The University of Chicago, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3711791.

Der volle Inhalt der Quelle

Annotation:

<p> Information complexity enables the use of information-theoretic tools in communication complexity theory. Prior to the results presented in this thesis, information complexity was mainly used for proving lower bounds and direct-sum theorems in the setting of communication complexity. We present three results that demonstrate new connections between information complexity and communication complexity.</p><p> In the first contribution we thoroughly study the information complexity of the smallest nontrivial two-party function: the AND function. While computing the communication complexity

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Smith, Peter. "Adaptive leadership: fighting complexity with complexity." Thesis, Monterey, California: Naval Postgraduate School, 2014. http://hdl.handle.net/10945/42728.

Der volle Inhalt der Quelle

Annotation:

CHDS State/Local<br>Contemporary crises have become increasingly complex and the methods of leading through them have failed to keep pace. If it is assumed that leadership matters—that it has a legitimate effect on the outcome of a crisis, then leaders have a duty to respond to that adaptation with modifications of their own. Using literature sources, the research explores crisis complexity, crisis leadership, and alternative leadership strategies. Specifically, the research evaluates the applicability of complexity science to current crises. Having identified the manner in which crises have c

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Chen, Lijie S. M. Massachusetts Institute of Technology. "Fine-grained complexity meets communication complexity." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/122754.

Der volle Inhalt der Quelle

Annotation:

Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 215-229).<br>Fine-grained complexity aims to understand the exact exponent of the running time of fundamental problems in P. Basing on several important conjectures such as Strong Exponential Time Hypothesis (SETH), All-Pair Shortest Path Conjecture, and the 3-Sum Conjecture, tight conditional lower bounds are proved for numerous exact problems from all fields of computer science, showing that

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Gopalakrishnan, K. S. "Complexity cores in average-case complexity theory." [Ames, Iowa : Iowa State University], 2009. 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:1473222.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Brochenin, Rémi. "Separation logic : expressiveness, complexity, temporal extension." Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2013. http://tel.archives-ouvertes.fr/tel-00956587.

Der volle Inhalt der Quelle

Annotation:

This thesis studies logics which express properties on programs. These logics were originally intended for the formal verification of programs with pointers. Overall, no automated verification method will be proved tractable here- rather, we give a new insight on separation logic. The complexity and decidability of some essential fragments of this logic for Hoare triples were not known before this work. Also, its combination with some other verification methods was little studied. Firstly, in this work we isolate the operator of separation logic which makes it undecidable. We describe the expr

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Otto, James R. (James Ritchie). "Complexity doctrines." Thesis, McGill University, 1995. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=29104.

Der volle Inhalt der Quelle

Annotation:

We characterize various complexity classes as the images in set$ sp2,$ set$ sp{V},$ and set$ sp3$ of categories initial in various complexity doctrines. (A doctrine consists of the models of a theory of theories.) We so characterize the linear time, P space, linear space, P time, and Kalmar elementary functions as well as the linear time hierarchy relations. (Our machine model is multi-tape Turing machines with constant number of tapes.) These doctrines extend, using comprehensions, the first order doctrines GM and JB. We show, using dependent product diagrams, how to so extend the higher orde

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Ada, Anil. "Communication complexity." Thesis, McGill University, 2014. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=121119.

Der volle Inhalt der Quelle

Annotation:

Communication complexity studies how many bits a certain number of parties need to communicate with each other in order to compute a function whose input is distributed among those parties. Although it is a natural area of investigation based on practical considerations, the main motivation comes from the myriad of applications in theoretical computer science.This thesis has three main parts, studying three different aspects of communication complexity.1. The first part is concerned with the k-party communication complexity of functions F:({0,1}^n)^k -> {0,1} in the 'number on the forehead' (N

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Mariotti, Humberto, and Cristina Zauhy. "Managing Complexity." Universidad Peruana de Ciencias Aplicadas (UPC), 2014.

Den vollen Inhalt der Quelle finden

Annotation:

This article is a brief introduction to complexity, complex thinking and complexitymanagement. Its purpose is to present an update on the applications of the complexitysciences particularly to the universe of corporations and management. It includes anexample taken from the globalized world and two more stories from the corporateenvironment. Some details on how to think about complexity and how to apply theconceptual and operative tools of complex thinking are provided. The article ends withsome remarks on personal, interpersonal and corporate benefits of the complexthinking.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Sharp, L. Kathryn. "Text Complexity." Digital Commons @ East Tennessee State University, 2014. https://dc.etsu.edu/etsu-works/4290.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Wennberg, Andreas, and Emil Persson. "Coopetition and Complexity : Exploring a Coopetitive Relationship with Complexity." Thesis, Umeå universitet, Handelshögskolan vid Umeå universitet (USBE), 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-52689.

Der volle Inhalt der Quelle

Annotation:

Cooperation have in previous research been seen as a negative impact on competition and vice versa. This thesis is building on a concept called coopetition in which cooperation and competition is studied simultaneously. Coopetition have been studied in terms of the level of cooperation and competition. However, we found a possible link between coopetition and complexity in previous literature. Thus, the purpose of this study is to explore whether complexity can develop an understanding for what organizations within a company group cooperate and compete about as well what they want to coo

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Okabe, Yasuo. "Parallel Computational Complexity and Date-Transfer Complexity of Supercomputing." Kyoto University, 1994. http://hdl.handle.net/2433/74658.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Raynard, Mia. "Deconstructing Complexity: Configurations of Institutional Complexity and Structural Hybridity." SAGE Publications, 2016. http://dx.doi.org/10.1177/1476127016634639.

Der volle Inhalt der Quelle

Annotation:

This article unpacks the notion of institutional complexity and highlights the distinct sets of challenges confronting hybrid structural arrangements. The framework identifies three factors that contribute to the experience of complexity - namely, the extent to which the prescriptive demands of logics are incompatible, whether there is a settled or widely accepted prioritization of logics within the field, and the degree to which the jurisdictions of the logics overlap. The central thesis is that these "components" of complexity variously combine to produce four distinct institutional landscap

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Colijn, Caroline. "Addressing complexity, exploring social change through chaos and complexity theory." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq43374.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Large, David. "Complexity and communities : the application of complexity to community studies." Thesis, Northumbria University, 2015. http://nrl.northumbria.ac.uk/25244/.

Der volle Inhalt der Quelle

Annotation:

Understanding community dynamics has always been a challenge for policy-makers. Often community policy has been ineffective and wasteful. This research explores and sets out an alternative, complexity-informed approach to community studies. The research develops an innovative, two-stage interview methodology informed by complexity considerations. This methodology is applied to two case studies of community-based organisations in Newcastle upon Tyne. The two case studies allow a comparative assessment of the complexity-informed methodology. In this way, the research uses a complexity-informed a

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Uden, Jacobus Cornelis van. "Organisation & complexity : using complexity science to theorise organisational aliveness /." [S. l. : s. n.], 2004. http://catalogue.bnf.fr/ark:/12148/cb39270773j.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Below, Alexander. "Complexity of triangulation /." [S.l.] : [s.n.], 2002. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=14672.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Rezaei, Hengameh. "Models complexity measurement." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-68701.

Der volle Inhalt der Quelle

Annotation:

The demand for measuring the quality aspects and need for higher maintainability and understandability of the models are increasing within the field of software engineering and management. Among these, complex models are of special interest for designers as they are more correlated to the eventual reliability of the system and therefore are considered very important. This study presents a method for measuring the complexity of existing software models in Ericsson seeking to raise the maintainability and understandability of the software engineering project in progress. A literature survey was

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Mayhew, Dillon. "Matroids and complexity." Thesis, University of Oxford, 2005. http://ora.ox.ac.uk/objects/uuid:23640923-17c3-4ad8-9845-320e3b662910.

Der volle Inhalt der Quelle

Annotation:

We consider different ways of describing a matroid to a Turing machine by listing the members of various families of subsets, and we construct an order on these different methods of description. We show that, under this scheme, several natural matroid problems are complete in classes thought not to be equal to P. We list various results linking parameters of basis graphs to parameters of their associated matroids. For small values of k we determine which matroids have the clique number, chromatic number, or maximum degree of their basis graphs bounded above by k. If P is a class of graphs that

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Chew, Leroy Nicholas. "QBF proof complexity." Thesis, University of Leeds, 2017. http://etheses.whiterose.ac.uk/18281/.

Der volle Inhalt der Quelle

Annotation:

Quantified Boolean Formulas (QBF) and their proof complexity are not as well understood as propositional formulas, yet remain an area of interest due to their relation to QBF solving. Proof systems for QBF provide a theoretical underpinning for the performance of these solvers. We define a novel calculus IR-calc, which enables unification of the principal existing resolution-based QBF calculi and applies to the more powerful Dependency QBF (DQBF). We completely reveal the relative power of important QBF resolution systems, settling in particular the relationship between the two different types

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Beheshti, Soosan 1969. "Minimum description complexity." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/8012.

Der volle Inhalt der Quelle

Annotation:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.<br>Includes bibliographical references (p. 136-140).<br>The classical problem of model selection among parametric model sets is considered. The goal is to choose a model set which best represents observed data. The critical task is the choice of a criterion for model set comparison. Pioneer information theoretic based approaches to this problem are Akaike information criterion (AIC) and different forms of minimum description length (MDL). The prior assumption in these methods is

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Uzuner, Tolga. "Effective network complexity." Thesis, University of Cambridge, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.612749.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Washburn, Fred AlDean. "Supervisee cognitive complexity." Diss., University of Iowa, 2015. https://ir.uiowa.edu/etd/1791.

Der volle Inhalt der Quelle

Annotation:

Supervision literature has indicated the importance of the supervisory working alliance in the development of effective supervision (Landy, Ellis, & Friedlander, 1999). While there has been a wealth of research on the role of the supervisory working alliance within supervision, there is a dearth of information on how this alliance is formed (Cooper & Ng, 2009). The purpose of this study is to examine if supervision cognitive complexity is a unique aspect of cognitive complexity within counseling and better understand its role in the formation of the supervisory working alliance. Forty-two part

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Winerip, Jason. "Graph Linear Complexity." Scholarship @ Claremont, 2008. https://scholarship.claremont.edu/hmc_theses/216.

Der volle Inhalt der Quelle

Annotation:

This thesis expands on the notion of linear complexity for a graph as defined by Michael Orrison and David Neel in their paper "The Linear Complexity of a Graph." It considers additional classes of graphs and provides upper bounds for additional types of graphs and graph operations.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Aleo, Ignazio. "Complexity in motion." Doctoral thesis, Università di Catania, 2012. http://hdl.handle.net/10761/1072.

Der volle Inhalt der Quelle

Annotation:

In the last few years a lot of works have been done in the field of motor control and in motion analysis. Several different hypotheses have been described and reviewed to understand living beings on motor coordination. What is commonly referred to, as motor control is indeed an articulated problem that is, at least from a robotic perspective, often more suitably divided in: sensing (perception, cognition), deliberation, planning, kinematic control and dynamic control. Through the pages of this work, several different problems related to motion control, to living beings motion and to its robot

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Dervic, Amina, and Alexander Rank. "ATC complexity measures: Formulas measuring workload and complexity at Stockholm TMA." Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-114534.

Der volle Inhalt der Quelle

Annotation:

Workload and complexity measures are, as of today, often imprecise and subjective. Currently, two commonly used workload and complexity measuring formulas are Monitor Alert Parameter and the “Bars”, both using the same measurement variables; amount of aircraft and time. This study creates formulas for quantifying ATC complexity. The study is done in an approach environment and is developed and tested on Stockholm TMA by the creation of 20 traffic scenarios. Ten air traffic controllers working in Stockholm TMA studied the complexity of the scenarios individually and ranked the scenarios in refe

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Addy, Robert. "Cost of complexity : mitigating transition complexity in mixed-model assembly lines." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/126942.

Der volle Inhalt der Quelle

Annotation:

Thesis: M.B.A., Massachusetts Institute of Technology, Sloan School of Management, in conjunction with the Leaders for Global Operations Program at MIT, May, 2020<br>Thesis: S.M., Massachusetts Institute of Technology, Department of Mechanical Engineering, in conjunction with the Leaders for Global Operations Program at MIT, May, 2020<br>Cataloged from the official PDF of thesis.<br>Includes bibliographical references (page 72).<br>The Nissan Smyrna automotive assembly plant is a mixed-model production facility which currently produces six different vehicle models. This mixed-model assembly st

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Lacayo, Virginia. "Communicating Complexity: A Complexity Science Approach to Communication for Social Change." Ohio University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1367522049.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Pontoizeau, Thomas. "Community detection : computational complexity and approximation." Thesis, Paris Sciences et Lettres (ComUE), 2018. http://www.theses.fr/2018PSLED007/document.

Der volle Inhalt der Quelle

Annotation:

Cette thèse étudie la détection de communautés dans le contexte des réseaux sociaux. Un réseau social peut être modélisé par un graphe dans lequel les sommets représentent les membres et les arêtes représentent les relations entre les membres. En particulier, j'étudie quatre différentes définitions de communauté. D'abord, une structure en communautés peut être définie par une partition des sommets telle que tout sommet a une plus grande proportion de voisins dans sa partie que dans toute autre partie. Cette définition peut être adaptée pour l'étude d'une seule communauté. Ensuite, une communau

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Melkebeek, Dieter van. "Randomness and completeness in computational complexity." New York : Springer, 2000. http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=1950.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Monet, Mikaël. "Combined complexity of probabilistic query evaluation." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLT003/document.

Der volle Inhalt der Quelle

Annotation:

L'évaluation de requêtes sur des données probabilistes(probabilistic query evaluation, ou PQE) est généralement très coûteuse enressources et ce même à requête fixée. Bien que certaines restrictions sur les requêtes et les données aient été proposées pour en diminuerla complexité, les résultats existants ne s'appliquent pas à la complexité combinée, c'est-à-dire quand la requête n'est pas fixe.Ma thèse s'intéresse à la question de déterminer pour quelles requêtes et données l'évaluation probabiliste est faisable en complexité combinée.La première contribution de cette thèse est d'étudier PQE p

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Osberg, Deborah Carol. "Curriculum, complexity and representation : rethinking the epistemology of schooling through complexity theory." Thesis, Open University, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.417476.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

De, Coning Cedric Hattingh. "Complexity, peacebuilding and coherence : implications of complexity for the peacebuilding coherence dilemma." Thesis, Stellenbosch : Stellenbosch University, 2012. http://hdl.handle.net/10019.1/71891.

Der volle Inhalt der Quelle

Annotation:

Thesis (PhD)--Stellenbosch University, 2012.<br>ENGLISH ABSTRACT: This dissertation explores the utility of using Complexity studies to improve our understanding of peacebuilding and the coherence dilemma, which is regarded as one of the most significant problems facing peacebuilding interventions. Peacebuilding is said to be complex, and this study investigates what this implies, and asks whether Complexity could be of use in improving our understanding of the assumed causal link between coherence, effectiveness and sustainability. Peacebuilding refers to all actions undertaken by the intern

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Falcioni, Valentina. "Complexity of Seifert manifolds." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/17054/.

Der volle Inhalt der Quelle

Annotation:

In this thesis, we give an overview over the theory of Seifert fibre spaces and the complexity theory. We start by giving some preliminary notions about 2-dimensional orbifolds, fibre bundles and circle bundles, in order to be able to understand the following part of the thesis, regarding the theory of Seifert fibre spaces. We first see the definition and properties of Seifert fibre spaces and, after giving a combinatorial description, we classify them up to fibre-preserving homeomorphism and up to homeomorphism. Afterwards, we introduce the complexity theory, at first in a general way concer

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Esteban, Ángeles Juan Luis. "Complexity measures for resolution." Doctoral thesis, Universitat Politècnica de Catalunya, 2003. http://hdl.handle.net/10803/6642.

Der volle Inhalt der Quelle

Annotation:

Esta obra es una contribución al campo de la Complejidad de la Demostración, que estudia la complejidad de los sistemas de demostración en términos de los recursos necesarios para demostrar o refutar fórmulas proposicionales. La Complejidad de la Demostración es un interesante campo relacionado con otros campos de la Informática como la Complejidad Computacional o la Demostración Automática entre otros. Esta obra se centra en medidas de complejidad para sistemas de demostración refutacionales para fórmulas en FNC. Consideramos varios sistemas de demostración, concretamente Resolución, R(k) y P

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Chan, Ming-Yan. "Video encoder complexity reduction /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202005%20CHANM.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Widmer, Steven. "Topics in word complexity." Thesis, Lyon 1, 2010. http://www.theses.fr/2010LYO10287/document.

Der volle Inhalt der Quelle

Annotation:

Les principaux sujets d'intérêt de cette thèse concerneront deux notions de la complexité d'un mot infini : la complexité abélienne et la complexité de permutation. La complexité abélienne a été étudiée durant les dernières décennies. La complexité de permutation est, elle, une forme de complexité des mots relativement nouvelle qui associe à chaque mot apériodique de manière naturelle une permutation infinie. Nous nous pencherons sur deux sujets dans le domaine de la complexité abélienne. Dans un premier temps, nous nous intéresserons à une notion abélienne de la maximal pattern complexity déf

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Chan, Siu Man. "Pebble Games and Complexity." Thesis, University of California, Berkeley, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=3593787.

Der volle Inhalt der Quelle

Annotation:

<p> We study the connection between pebble games and complexity.</p><p> First, we derive complexity results using pebble games. It is shown that three pebble games used for studying computational complexity are equivalent: namely, the two-person pebble game of Dymond-Tompa, the two-person pebble game of Raz-McKenzie, and the one-person reversible pebble game of Bennett have the same pebble costs over any directed acyclic graph. The three pebble games have been used for studying parallel complexity and for proving lower bounds under restricted settings, and we show one more such lower bound o

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Viyuygin, Mikhail. "Mixability and predictive complexity." Thesis, Royal Holloway, University of London, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.414435.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Cooper, D. "Classes of low complexity." Thesis, University of Oxford, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.375251.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Dam, Wim van. "Nonlocality and communication complexity." Thesis, University of Oxford, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325982.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Farr, Graham E. "Topics in computational complexity." Thesis, University of Oxford, 1986. http://ora.ox.ac.uk/objects/uuid:ad3ed1a4-fea4-4b46-8e7a-a0c6a3451325.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Hardman, Mark. "Complexity and classroom learning." Thesis, Canterbury Christ Church University, 2015. http://create.canterbury.ac.uk/14466/.

Der volle Inhalt der Quelle

Annotation:

This thesis provides a theoretical basis for applying complexity theory to classroom learning. Existing accounts of complexity in social systems fail to adequately situate human understanding within those systems. Human understanding and action is embedded within the complex systems that we inhabit. As such, we cannot achieve a full and accurate representation of those systems. This challenges epistemological positions which characterise learning as a simple mechanistic process, those which see it as approaching a view of the world 'as it is' and also positions which see learning as a purely s

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Preda, Daniel C. (Daniel Ciprian) 1979. "Quantum query complexity revisited." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/29689.

Der volle Inhalt der Quelle

Annotation:

Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.<br>Includes bibliographical references (leaves 30-31).<br>In this thesis, we look at the polynomial method for quantum query complexity and relate it to the BQPA = PA question for a random oracle A. We will also look at some open problems and improve some bounds relating classical and quantum complexity.<br>by Daniel C. Preda.<br>M.Eng.and S.B.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Kim, Christopher Eric. "Composites cost modeling : complexity." Thesis, Massachusetts Institute of Technology, 1993. http://hdl.handle.net/1721.1/12357.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Collender, Michael. "Complexity and hermeneutic phenomenology." Thesis, Stellenbosch : Stellenbosch University, 2008. http://hdl.handle.net/10019.1/1084.

Der volle Inhalt der Quelle

Annotation:

Thesis (DPhil (Philosophy))--Stellenbosch University, 2008.<br>This thesis argues that the study of the brain as a system, which includes the disciplines of cognitive science and neuroscience, is a kind of textual exegesis, like literary criticism. Through research in scientific modeling in the 20th and early 21st centuries, anong with the advances of nonlinear science, and both cognitive science and neuroscience, along with the work of Aristotle, Saussure, and Paul Ricoeur, I argue that the parts of the brain have multiple functions, like words have multiple uses. Ricoeur, through Aristo

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

De, Villiers Tanya. "Complexity and the self." Thesis, Stellenbosch : Stellenbosch University, 2002. http://hdl.handle.net/10019.1/52744.

Der volle Inhalt der Quelle

Annotation:

Thesis (MA)--University of Stellenbosch, 2002.<br>ENGLISH ABSTRACT: In this thesis it is argued that the age-old philosophical "Problem of the Self' can benefit by being approached from the perspective of a relatively recent science, namely that of Complexity Theory. With this in mind the conceptual features of this theory is highlighted and summarised. Furthermore, the argument is made that the predominantly dualistic approach to the self that is characteristic of the Western Philosophical tradition serves to hinder, rather than edify, our understanding of the phenomenon. The benefits

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Gurr, Douglas J. "Semantic frameworks for complexity." Thesis, University of Edinburgh, 1990. http://hdl.handle.net/1842/13968.

Der volle Inhalt der Quelle

Annotation:

This thesis extends denotational semantics to take account of the resource requirements of programs. We describe the approach we have taken in modelling the resource requirements of programs, and motivate the definition of a monoid <i>M</i> of resource values. A connection is established with Moggi's categorical semantics of computations, and this connection is exploited to study complexity as a monad constructor. A formal system, the λcom-calculus, for reasoning the resource requirements of programs is developed. Operational and denotational semantics are defined for this system, and we prove

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Jones, Charles H., and Lee S. Gardner. "COMPLEXITY OF PCM FORMATTING." International Foundation for Telemetering, 1997. http://hdl.handle.net/10150/609697.

Der volle Inhalt der Quelle

Annotation:

International Telemetering Conference Proceedings / October 27-30, 1997 / Riviera Hotel and Convention Center, Las Vegas, Nevada<br>How difficult is it to develop a pulse code modulation (PCM) stream data format? Specifically, given a size, in bits, and a set of parameter sample rates, how hard is it to find a mapping of the sample rates that fits into the frame size -- if one even exists? Using telemetry trees this paper will show that the number of possible mappings for a given set of parameters and sample rates grows exponentially in terms of the number of parameters. The problem can thus b

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!