Se connecter

Bibliographies thématiques / Complexity Engineering / Thèses

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Complexity Engineering.

Thèses sur le sujet « Complexity Engineering »

Auteur : Grafiati

Publié le 2 juin 2025

Mis à jour le 31 juillet 2025

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleures thèses pour votre recherche sur le sujet « Complexity Engineering ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.

1

Haribabu, Aravind Saravanan. "Active Interaction Complexity in Systems Engineering." Thesis, KTH, Skolan för industriell teknik och management (ITM), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-301619.

Texte intégral

Résumé :

The master's thesis describes how complexity measurement can enhance product development or design processes in collaboration with Scania CV AB. Scania has a strong track record in vehicle modularization and thus wanted to investigate the possibility of using complexity measures when architecting, developing, and maintaining complex engineering products such as electrified or self-driving trucks and buses to gain various types of benefits. The section YMPI at Scania, where the project is conducted, had, however, little experience in complexity measurements wants to identify and investigate whi

Styles APA, Harvard, Vancouver, ISO, etc.

2

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.

Texte intégral

Résumé :

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

Styles APA, Harvard, Vancouver, ISO, etc.

3

Trammell, Melanie Kaye. "Complexity of Engineering Identity: A Study of Freshmen Engineering Students." Thesis, Virginia Tech, 2019. http://hdl.handle.net/10919/91464.

Texte intégral

Résumé :

The General Engineering Program exists at Virginia Tech to provide curriculums that engage, challenge and support entry-level engineers. One important part of this initiative is helping students identify with a specific engineering branch, and overtime develop an identity within it. Yet, there exists little research on what entry-level engineers believe it means to be an engineer, especially during these stages of early formation and continual shifting. In order to generate insight on this topic we developed a contextual inquiry method to help inquire into engineering identity. Two participant

Styles APA, Harvard, Vancouver, ISO, etc.

4

Read, Craig. "Complexity characteristics and measurement within engineering systems." Thesis, Loughborough University, 2008. https://dspace.lboro.ac.uk/2134/8140.

Texte intégral

Résumé :

Complexity is a significant factor in the development of new products and systems; generally speaking, the higher the complexity, the more difficult products and systems are going to be to design and develop. There are a number of different factors that influence complexity within systems, namely: interoperability; upgradability; adaptability; evolving requirements; system size; automation requirements; performance requirements; support requirements; sustainability; reliability; the need for increased product lifespan; and finally, the length of time systems take to develop. There is, at prese

Styles APA, Harvard, Vancouver, ISO, etc.

5

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

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

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

Texte intégral

Résumé :

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

Styles APA, Harvard, Vancouver, ISO, etc.

7

Sridharan, Arun. "Low Complexity Scheduling in Wireless Networks." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1366072589.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

8

Lee, Tae-Sik 1974. "Complexity theory in axiomatic design." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/29631.

Texte intégral

Résumé :

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2003.<br>Includes bibliographical references (p. 177-182).<br>During the last couple of decades, the term complexity has been commonly found in use in many fields of science, sometimes as a measurable quantity with a rigorous but narrow definition and other times as merely an ad hoc label. With an emphasis on pragmatic engineering applications, this thesis investigates the complexity concept defined in axiomatic design theory to avoid vague use of the term 'complexity' in engineering system design, to prov

Styles APA, Harvard, Vancouver, ISO, etc.

9

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

Texte intégral

Résumé :

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.

Styles APA, Harvard, Vancouver, ISO, etc.

10

Neyer, Gabriele. "Algorithms, complexity, and software engineering in computational geometry : case studies /." [S.l.] : [s.n.], 2000. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=13586.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

11

Hinz, Denis. "Sources of complexity in fluid flow." Thesis, McGill University, 2014. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=123281.

Texte intégral

Résumé :

In the first part of this thesis, one-point and two-point statistics of the Navier–Stokes-alpha-beta (NS-alpha-beta) regularization model in homogeneous isotropic turbulence are explored. The results are compared to the limit cases of the Navier–Stokes-alpha (NS-alpha) model and the NS-alpha-beta model without subgrid-scale (SGS) stress, as well as with high-resolution direct numerical simulation (DNS). After reviewing spectra of different energy norms, probability density functions (PDFs) of the filtered and unfiltered velocity increments along with longitudinal velocity structure functions o

Styles APA, Harvard, Vancouver, ISO, etc.

12

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.

Texte intégral

Résumé :

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

Styles APA, Harvard, Vancouver, ISO, etc.

13

Ben, David Shalev. "Quantum speedups in query complexity." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113996.

Texte intégral

Résumé :

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 135-141).<br>In this thesis, we study randomized and quantum algorithms in the query complexity model. We investigate when and by how much quantum algorithms provide a speedup over the best possible classical algorithm in the query complexity setting. We introduce a total Boolean function that exhibits a power 2.5 quantum speedup compared to the best possible randomized algorithm. In the pr

Styles APA, Harvard, Vancouver, ISO, etc.

14

Gelashvili, Rati. "On the complexity of synchronization." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/111856.

Texte intégral

Résumé :

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 183-197).<br>The field of distributed algorithms revolves around efficiently solving synchronization tasks, such as leader election and consensus. We make contributions towards a better understanding of the complexity of cent

Styles APA, Harvard, Vancouver, ISO, etc.

15

Drucker, Andrew Donald. "The complexity of joint computation." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/78445.

Texte intégral

Résumé :

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 253-266).<br>Joint computation is the ubiquitous scenario in which a computer is presented with not one, but many computational tasks to perform. A fundamental question arises: when can we cleverly combine computations, to perform them with greater efficiency or reliability than by tackling them separately? This thesis investigates the power and, especially, the limits of efficient joint computati

Styles APA, Harvard, Vancouver, ISO, etc.

16

McLean, James Stephen. "Navigational Complexity Within Building Codes." ScholarWorks @ UVM, 2017. http://scholarworks.uvm.edu/graddis/812.

Texte intégral

Résumé :

The premise, that building codes have become too complex, has been discussed, commented on, and documented by practicing engineers; however, prior to this research there was little scientific evidence that codes have increased in complexity over time. There are many aspects of building codes that are complicated, and this reflects a combination of the inherent complexity of building design and the dynamical processes that produce the codes. This research focuses on navigational complexity and specifically the aspects that can be quantified to demonstrate current codes are more complex than the

Styles APA, Harvard, Vancouver, ISO, etc.

17

Mihm, Jürgen. "Complexity in new product development : mastering the dynamics of engineering projects /." Wiesbaden: Dt. Univ.-Verl, 2003. http://www.gbv.de/dms/zbw/363286098.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

18

Steele, Joseph Allan McKinnon. "Development of scaffolds incorporating zonal complexity for articular cartilage tissue engineering." Thesis, Imperial College London, 2015. http://hdl.handle.net/10044/1/52781.

Texte intégral

Résumé :

Articular cartilage is an anisotropic tissue composed of compositional and functional layers. One clinical approach to the regeneration of articular cartilage defects incorporates a porous polymer scaffold to support and direct cartilage formation in full‐thickness defects. These scaffolds are regularly isotropic in structure, unlike the tissue they aim to regenerate. A number of scaffold production techniques were combined to produce porous anisotropic scaffolds with zonally‐biomimetic microarchitecture and mechanical properties. The final scaffold design featured a combination of an electros

Styles APA, Harvard, Vancouver, ISO, etc.

19

Riolo, Joseph S. "A Comparative Analysis of Genome Complexity and Manufacturability with Engineering Benchmarks." University of Cincinnati / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1627663196868138.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

20

Hu, Ketai. "Reduced-complexity decoding of fountain codes." Thesis, University of Ottawa (Canada), 2006. http://hdl.handle.net/10393/27254.

Texte intégral

Résumé :

Fountain codes are a universal class of rateless codes originally designed for erasure channels. Naturally adapting to channel states without channel knowledge at the transmitter, Fountain codes have recently been demonstrated also as an appealing solution for communication over fading channels. However, their relatively high decoding complexity limits their practical use in a wireless setting. In this thesis, we present a new decoding algorithm for Raptor codes---a type of Fountain codes---over fading channels, where the complexity is significantly reduced without sacrifice of performance.

Styles APA, Harvard, Vancouver, ISO, etc.

21

Foster, Jason. "Understanding and Improving Undergraduate Engineering Education." Thesis, University of Waterloo, 2001. http://hdl.handle.net/10012/849.

Texte intégral

Résumé :

This thesis seeks to understand the past and present state of engineering education and to plot a course for its future evolution. This research is limited to engineering education as it has taken place in North American universities during the last half of the 20th century. Within this context, broad trends are described. The description is supplemented with a case study of a unique and innovative engineering programme. The trends and case study form the foundation of a synthesis, and alternative vision, for higher education and engineering education. The intended audience of this t

Styles APA, Harvard, Vancouver, ISO, etc.

22

Rossman, Benjamin (Benjamin E. ). "Average-case complexity of detecting cliques." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/62441.

Texte intégral

Résumé :

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 79-83).<br>The computational problem of testing whether a graph contains a complete subgraph of size k is among the most fundamental problems studied in theoretical computer science. This thesis is concerned with proving lower bounds for k-CLIQUE, as this problem is known. Our results show that, in certain models of computation, solving k-CLIQUE in the average case requires Q(nk/4) resources (more

Styles APA, Harvard, Vancouver, ISO, etc.

23

Wu, Ray Hua. "Complexity of minesweeper with restricted number." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/119557.

Texte intégral

Résumé :

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 51-52).<br>We consider the Minesweeper consistency problem (is a given partially completed board consistent with some mine placement?) when the set of numbers that may appear on a Minesweeper board is restricted. First, we a

Styles APA, Harvard, Vancouver, ISO, etc.

24

Harsha, Prahladh 1976. "Small PCPs with low query complexity." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86448.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

25

Tzamos, Christos. "The complexity of optimal mechanism design." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82373.

Texte intégral

Résumé :

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 63-64).<br>Myerson's seminal work provides a computationally efficient revenue-optimal auction for selling one item to multiple bidders. Generalizing this work to selling multiple items at once has been a central question in economics and algorithmic game theory, but its complexity has remained poorly understood. We answer this question by showing that a revenue-optimal auction in multi-item setting

Styles APA, Harvard, Vancouver, ISO, etc.

26

Lai, Katherine Jane. "Complexity of union-split-find problems." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45638.

Texte intégral

Résumé :

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Includes bibliographical references (p. 45-46).<br>In this thesis, we investigate various interpretations of the Union-Split-Find problem, an extension of the classic Union-Find problem. In the Union-Split Find problem, we maintain disjoint sets of ordered elements subject to the operations of constructing singleton sets, mergin

Styles APA, Harvard, Vancouver, ISO, etc.

27

Kamath, Pritish. "Communication complexity of permutation-invariant functions." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99861.

Texte intégral

Résumé :

Thesis: S.M. in Computer Science & Engineering, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 68-71).<br>Motivated by the quest for a broader understanding of communication complexity of simple functions, we introduce the class of "permutation-invariant" functions. A partial function f : {0, 1}n x {0, 1}n --> {0, 1, ?} is permutation-invariant if for every bijection [pi]: {1,..., n} --> {1,.. ., n} and every x, y [sum] {0, I}n, it is the case that f (

Styles APA, Harvard, Vancouver, ISO, etc.

28

Fernandez, Jose A. (Jose Antonio Fernandez Chavira), and Henry N. Okafor. "Modeling the impact of complexity on transportation." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/77461.

Texte intégral

Résumé :

Thesis (M. Eng. in Logistics)--Massachusetts Institute of Technology, Engineering Systems Division, 2012.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 74-75).<br>This thesis aimed to understand the drivers of total transportation costs during supply chain complexity events, in particular new product launches, in a fast moving consumer goods company in the United States. The research specifically investigated which of the four key transportation cost drivers (line haul rates, length of haul, frequency of loads and regional factors) changed the most during

Styles APA, Harvard, Vancouver, ISO, etc.

29

See, Ying-Lai, and Jin Namkoong. "Impact of product complexity on inventory levels." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/35535.

Texte intégral

Résumé :

Thesis (M. Eng. in Logistics)--Massachusetts Institute of Technology, Engineering Systems Division, 2006.<br>Includes bibliographical references (leaves 62-63).<br>In this thesis we consider a manufacturing and distribution supply chain of a roll-based product whose width comes in 1-cm increments. We formulate a computer model subject to stochastic, inelastic demand to determine the relationship between width interval and finished goods inventory levels. Assuming that the supply chain operates with the same set of policies regardless of the width interval value, we illustrate that the value of

Styles APA, Harvard, Vancouver, ISO, etc.

30

Francis, Helen. "Orebody complexity in geological control over selective mining." Thesis, McGill University, 1998. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=20204.

Texte intégral

Résumé :

This thesis proposes a morphological complexity index for use in classifying orebodies. Formulated and tailored for application on underground steep clipping narrow base metal orebodies from Inco Limited's Manitoba Division, the complexity index was proved transferable to the base metal deposits of Inco Limited's Ontario Division. Thus it appears that the index could be applied to various styles of mineralization and orebody morphology.<br>The complexity classification was designed to aid in geologic control and subsequently improve mining method performance. Motivated by an industry wide move

Styles APA, Harvard, Vancouver, ISO, etc.

31

Baikovicius, Jimmy. "Theory and applications of predictive stochastic complexity." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=39533.

Texte intégral

Résumé :

The objective of this thesis is to solve model order selection, and change-point detection problems in real time using a form of predictive stochastic complexity. A consistent method for finding the best model order for certain kinds of ARMA processes is presented. An interesting fact is that the estimator "badness", obtained when using fixed gain, increases the "badness" of overparametrization. Model order selection simulations involving AR processes illustrate this fact very clearly. A successful model order selection simulation for ARMA processes is presented.<br>A change-point detection me

Styles APA, Harvard, Vancouver, ISO, etc.

32

Coleman, Todd P. (Todd Prentice) 1977. "Low-complexity approaches to distributed data dissemination." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/35286.

Texte intégral

Résumé :

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Includes bibliographical references (p. 145-153).<br>In this thesis we consider practical ways of disseminating information from multiple senders to multiple receivers in an optimal or provably close-to-optimal fashion. The basis for our discussion of optimal transmission of information is mostly information theoretic - but the m

Styles APA, Harvard, Vancouver, ISO, etc.

33

Niyogi, Partha. "The informational complexity of learning from examples." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/36990.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

34

Remscrim, Zachary (Zachary N. ). "Algebraic methods in pseudorandomness and circuit complexity." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/106089.

Texte intégral

Résumé :

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 93-96).<br>In this thesis, we apply tools from algebra and algebraic geometry to prove new results concerning extractors for algebraic sets, AC⁰-pseudorandomness, the recursive Fourier sampling problem, and VC dimension. We present a new construction of an extractor which works for algebraic sets defined by polynomials over F₂ of substantially higher degree than the previous state-of-the-ar

Styles APA, Harvard, Vancouver, ISO, etc.

35

Lombardi, Alex (Alex John). "Low complexity pseudorandom generators and indistinguishability obfuscation." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/118056.

Texte intégral

Résumé :

Thesis: S.M. in Computer Science and Engineering, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 61-64).<br>In the study of cryptography in NCO, it was previously known that Goldreich's candidate pseudorandom generator (PRG) is insecure when instantiated with a predicate P in 4 or fewer variables, if one wants to achieve polynomial stretch. On the other hand, there is a standard candidate PRG with locality 5 based on the "tri-sum-and" predicate ... How

Styles APA, Harvard, Vancouver, ISO, etc.

36

Hoest, Gunnar Waaler 1972. "Towards a topological characterization of asynchronous complexity." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/43581.

Texte intégral

Résumé :

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.<br>Includes bibliographical references (p. 74-77).<br>by Gunnar Waaler Hoest.<br>M.Eng.

Styles APA, Harvard, Vancouver, ISO, etc.

37

Tseng, Jessica Hui-Chun 1977. "Banked microarchitectures for complexity-effective superscalar microprocessors." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/37901.

Texte intégral

Résumé :

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.<br>Includes bibliographical references (p. 95-99).<br>High performance superscalar microarchitectures exploit instruction-level parallelism (ILP) to improve processor performance by executing instructions out of program order and by speculating on branch instructions. Monolithic centralized structures with global communications, including issue windows and register files, are used to buffer in-flight instructions and to maintain machine state. These structures scale poorly to gre

Styles APA, Harvard, Vancouver, ISO, etc.

38

Sturtevant, Daniel Joseph. "System design and the cost of architectural complexity." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/79551.

Texte intégral

Résumé :

Thesis (Ph. D.)--Massachusetts Institute of Technology, Engineering Systems Division, 2013.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 159-166).<br>Many modern systems are so large that no one truly understands how they work. It is well known in the engineering community that architectural patterns (including hierarchies, modules, and abstraction layers) should be used in design because they play an important role in controlling complexity. These patterns make a system easier to evolve and keep its separate portions within the bounds of human understand

Styles APA, Harvard, Vancouver, ISO, etc.

39

Wood, Hannah Louise. "Modelling project complexity at the pre construction stage." Thesis, University of Brighton, 2010. https://research.brighton.ac.uk/en/studentTheses/66941b79-c405-467c-a971-ebb691bc2b2e.

Texte intégral

Résumé :

Construction project success is normally assessed based upon time, cost and quality. One or more of these three key measures of success are often not met and one factor contributing to this is the increasing complexity of modern construction projects. However, little research into the understanding of construction project complexity and its effect on key measures of success has been conducted. Whilst much of the recent research has been focused on evaluating projects using risk assessment and management systems; the assessment of project complexity remains by implication rather than applicatio

Styles APA, Harvard, Vancouver, ISO, etc.

40

Lime, Hugo. "Cross-subframe channel estimation for low-complexity devices in LTE." Thesis, KTH, Teknisk informationsvetenskap, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-212066.

Texte intégral

Résumé :

One of the most critical issues of wireless communication systems is the timevaryingand frequency-selective channel. Knowledge about the channel greatlyimproves communication performance. It enables coherent demodulation andmeasurements of Signal to Noise Ratio (SNR) and Channel Quality Indicators(CQI). Theses measurements are used to optimize the transmission schemes dependingon the channel conditions. Therefore, the channel estimation is one ofthe most important feature of modern wireless communication devices. In the3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE) system,

Styles APA, Harvard, Vancouver, ISO, etc.

41

McElhaney, Steven Hunt. "Defining display complexity in electric utility system operator displays." Thesis, Mississippi State University, 2014. http://pqdtopen.proquest.com/#viewpdf?dispub=3603464.

Texte intégral

Résumé :

<p> In the electric utility industry, displays provide power system operators with information on and the status of the system, who then make decisions on how to maintain the safety, the reliability and the efficient operation of the utility generation and transmission grid based on that information. Complexity of the data presented and the display itself can lead to errors or misjudgments that can cause power system operators to make unwise decisions. The primary goal of this research was to develop a method to quantify display complexity for select displays used by system operators when oper

Styles APA, Harvard, Vancouver, ISO, etc.

42

Automo, Si-John. "Dependency of human operator performance quality upon task complexity." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/41005.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

43

Horne, Jennifer Amy. "Conditional covering problem: Study of complexity and optimization methods." Diss., The University of Arizona, 2004. http://hdl.handle.net/10150/290032.

Texte intégral

Résumé :

The Conditional Covering Problem (CCP) is a facility location problem on a graph, where the set of nodes represents the demand points and the potential facility locations. The CCP minimizes the sum of the facility location costs required to cover all demand points. The key aspect of the CCP is that a facility covers all nodes within a given coverage radius, except for the node on which it is located. Our investigation of the CCP will first show that solving CCP on a general graph structure is NP-Hard, prohibiting finding exact optimal solutions in a finite amount of time. While the CCP is NP-H

Styles APA, Harvard, Vancouver, ISO, etc.

44

Bergeron-Burns, Philippe. "Reduced complexity decoding for multiple antenna wireless communications." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=82467.

Texte intégral

Résumé :

One way to achieve high data rate and bandwidth efficient wireless communications is to employ multiple transmit and receive antennas creating a Multiple-Input Multiple-Output (MIMO) system, combined with Linear Dispersion (LD) codes. Sphere Decoder (SD) is a low complexity Maximum Likelihood (ML) method of decoding LD codes.<br>Using Subspace Matched Filtering principles, two complexity reducing front-ends to any variant of the SD, are developed. These two-stage decoders are designed to only have marginally worse performance than SD.<br>Computer simulations confirm the lower complexity

Styles APA, Harvard, Vancouver, ISO, etc.

45

Cai, Fang. "Low-complexity Decoding Algorithms and Architectures for Non-binary LDPC Codes." Case Western Reserve University School of Graduate Studies / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=case1372338108.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

46

Yu, Shih Bun. "Modelling of complexity in manufacturing networks and its application to system re-engineering." Thesis, University of Oxford, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.427639.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

47

Larrea-Alvarez, Marco. "Molecular tools and approaches for increasing complexity of transplastomic engineering in Chlamydomonas reinhardtii." Thesis, University College London (University of London), 2018. http://discovery.ucl.ac.uk/10047617/.

Texte intégral

Résumé :

Microalgae have been grown commercially for many years as a feedstock for aquaculture, and as a source of natural products such as pigments and omega-3 oils. More recently, the focus has turned to the development of microalgae as industrial biotechnological platforms, and several species are being explored as possible cell factories. One promising species is the green alga Chlamydmonas reinhardtii, which has been used extensively as a lab- oratory model for basic genetic and biochemistry studies. The repertoire of molecular and ’omics tools available for its genetic manipulation has in- crease

Styles APA, Harvard, Vancouver, ISO, etc.

48

Weightman, Alan Peter. "Enhancing the complexity of neural tissue engineering platforms for repair of neurological injury." Thesis, Keele University, 2015. http://eprints.keele.ac.uk/1205/.

Texte intégral

Résumé :

The extent of regeneration is often limited after spinal cord injury (SCI), due to the post-injury microenvironment that is unsupportive of nerve fibre regeneration and the limited intrinsic reparative capacity of neurons. Current mainstream clinical therapies focus on reducing the extent of damage in the early stages of injury, rather than promoting regenerative mechanisms in sites of pathology. In this context, one promising biomedical engineering strategy emerging globally to promote repair following SCI is the reconstruction of neural circuitry in injury sites via the implantation of polym

Styles APA, Harvard, Vancouver, ISO, etc.

49

Theodosopoulos, Theodore. "Worst-case identification in l1 : algorithms and complexity." Thesis, Massachusetts Institute of Technology, 1993. http://hdl.handle.net/1721.1/12608.

Texte intégral

Résumé :

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.<br>Includes bibliographical references (leaves 63-65).<br>by Theodore V. Theodosopoulos.<br>M.S.

Styles APA, Harvard, Vancouver, ISO, etc.

50

Luo, Zhi-Quan. "Communication complexity of some problems in distributed computation." Thesis, Massachusetts Institute of Technology, 1989. http://hdl.handle.net/1721.1/14344.

Texte intégral

Résumé :

Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1989.<br>Includes bibliographical references (leaves 153-158).<br>by Zhi-Quan Luo.<br>Sc.D.

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!