Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 4672 for “"Computation"”.
-
Economic allocation of computation time with computation markets
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.
-
Pulse computation
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1990.
-
Community computation
… a community to better perform some tasks, either computationally hard or economically prohibitive, or physically inconvenient, that one individual is unable to accomplish efficiently. We introduce community coding, where information systems meet social networks, to tackle some of the challenges in …
-
Rational Multiparty Computation
… This departs from the standard secure multiparty computation setting, where players are assumed to be either honest or malicious. ^ We detail the construction of both a two-party and a multiparty game theoretic framework for constructing rational cryptographic protocols. Our framework specifies …
-
Soft Morphological Computation
… and supports the theory of Soft Morphological Computation (SoMComp), by which a soft robot should appropriately condition, or ‘affect’, the soft interactions to improve the quality of the physical stimuli arising from it. SoMComp is composed of four main principles, i.e.: Soft Proprioception, …
-
Physics and computation
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Physics, 1987.
-
Minimizer-space computation
… In this thesis, we introduce minimizer-space computation as a new algorithmic paradigm for DNA sequence analysis. Instead of DNA nucleotides, we consider minimizers as the letters of an extended alphabet in which algorithms operate. We present several techniques on how to efficiently construct …
-
Robust network computation
… thesis, we present various models of distributed computation and algorithms for these models. The underlying theme is to come up with fast algorithms that can tolerate faults in the underlying network. We begin with the classical message-passing model of computation, surveying many known results. …
-
Translational design computation
… demonstrates and implements translational design computation: a theoretical approach and technical framework for mediating living and nonliving matter through design computation. I propose that computational design can act as a "language" for the enablement of design at the intersection of the …
-
Natively probabilistic computation
I introduce a new set of natively probabilistic computing abstractions, including probabilistic generalizations of Boolean circuits, backtracking search and pure Lisp. I show how these tools let one compactly specify probabilistic generative models, generalize and parallelize widely used sampling …
-
Self-distributing computation
… thesis, I propose a new model for distributing computational work in a parallel or distributed system. This model relies on exposing the topology and performance characteristics of the underlying architecture to the application. Responsibility for task distribution is divided between a run-time …
-
Translational design computation
… fabrication give rise to sophisticated tools of computational design, while new affordances in computational design inspire innovation in digital fabrication. The role of design in this process is that of synthesis through mediation. As designers, we mediate between different principles and …
-
Dissecting topological quantum computation
… have been considered as a means for quantum computation, but non-Abelian anyons are usually assumed to be better suited to the task. Here we challenge this view, demonstrating that Abelian anyon models have as much potential as some simple non-Abelian models. First the means to perform …
-
Leading Digit Computation Circuits
… can be made using partial results obtained mid-computation. This research presents three MSB-first computation circuits which allow for early computation termination: an accumulator, a comparator and an arithmetic processing element. The circuits are constructed based on a novel carry …
-
Preconditioning For Matrix Computation
… The two central subjects of numerical matrix computations are LIN-SOLVE, that is, the solution of linear systems of equations and EIGEN-SOLVE, that is, the approximation of the eigenvalues and eigenvectors of a matrix. We focus on the former subject of LIN-SOLVE and show an application to …
-
Coded Distributed Function Computation
… computer science research is the optimization of computation on large data sets. Such computations are usually too large to be performed on one machine and therefore the task needs to be distributed amongst a network of machines. However, a common problem within distributed computing is the …
-
Eliminating Dynamic Computation Redundancy
… utilization and performance. The Reusable Computation Region Framework (RCRF) provides a compilation framework to accurately determine the regions, called Reusable Computation Regions (RCRs), of a program in which reuse is likely to occur. The Compiler-directed Computation Reuse (CCR) …
-
Graphical Specification of Computation
Made available in DSpace on 2014-12-08T22:54:46Z (GMT). No. of bitstreams: 1 6901421.pdf: 3710404 bytes, checksum: cdfb15ca2f670a925409b4430b8a95d6 (MD5) Previous issue date: 1968
-
Graphical Specification of Computation
… No. of bitstreams: 1 Graphical Specification of Computation.pdf: 1858940 bytes, checksum: aaba1efd04d779c52a27de7c83a52756 (MD5)
-
Massively parallel neural computation
… science. This thesis focusses on real-time computation of large neural networks using the Izhikevich spiking neuron model. Neural computation has been described as “embarrassingly parallel” as each neuron can be thought of as an independent system, with behaviour described by a mathematical …
Page 1 of 234