Now showing items 669-688 of 763

    • Task-Structured Probabilistic I/O Automata 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2006-03-31)
      In the Probabilistic I/O Automata (PIOA) framework, nondeterministicchoices are resolved using perfect-information schedulers,which are similar to history-dependent policies for Markov decision processes(MDPs). These ...
    • Task-Structured Probabilistic I/O Automata 

      Canetti,, Ran; Cheung,, Ling; Kaynar,, Dilsun; Liskov,, Moses; Lynch,, Nancy; e.a. (2006-09-05)
      Modeling frameworks such as Probabilistic I/O Automata (PIOA) andMarkov Decision Processes permit both probabilistic andnondeterministic choices. In order to use such frameworks to express claims about probabilities of ...
    • Task-Structured Probabilistic I/O Automata 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2009.)
      Modeling frameworks such as Probabilistic I/O Automata (PIOA) and Markov Decision Processes permit both probabilistic and nondeterministic choices. In order to use these frameworks to express claims about probabilities of ...
    • tBurton: A Divide and Conquer Temporal Planner 

      Wang, David; Williams, Brian C. (2014-10-24)
      Planning for and controlling a network of interacting devices requires a planner that accounts for the automatic timed transitions of devices while meeting deadlines and achieving durative goals. For example, a planner for ...
    • Team MIT Urban Challenge Technical Report 

      Leonard, John; Barrett, David; How, Jonathan; Teller, Seth; Antone, Matt; e.a. (2007-12-14)
      This technical report describes Team MIT’s approach to theDARPA Urban Challenge. We have developed a novel strategy forusing many inexpensive sensors, mounted on the vehicle periphery,and calibrated with a new cross-­modal ...
    • Temporally Scalable Visual SLAM using a Reduced Pose Graph 

      Johannsson, Hordur; Kaess, Michael; Fallon, Maurice; Leonard, John J. (2012-05-25)
      In this paper, we demonstrate a system for temporally scalable visual SLAM using a reduced pose graph representation. Unlike previous visual SLAM approaches that use keyframes, our approach continually uses new measurements ...
    • The Tensor Algebra Compiler 

      Kjolstad, Fredrik; Kamil, Shoaib; Chou, Stephen; Lugato, David; Amarasinghe, Saman (2017-02-17)
      Tensor and linear algebra is pervasive in data analytics and the physical sciences. Often the tensors, matrices or even vectors are sparse. Computing expressions involving a mix of sparse and dense tensors, matrices and ...
    • The Architecture of MAITA: A Tool for Monitoring, Analysis, and Interpretation 

      Jon, Doyle; Kohane, Isaac; Long, William; Szolovits, Peter (2004-05-18)
      This report describes the aims, functions, and organization of the MAITAsystem for knowledge-based construction, adaptation, and control of networks of monitoringprocesses.
    • The Design of a Relational Engine 

      Torlak, Emina; Jackson, Daniel (2006-09-29)
      The key design challenges in the construction of a SAT-based relational engine are described, and novel techniques are proposed to address them. An efficient engine must have a mechanism for specifying partial solutions, ...
    • The Interval Programming Model for Multi-objective Decision Making 

      Benjamin, Michael R. (2004-09-27)
      The interval programming model (IvP) is a mathematical programmingmodel for representing and solving multi-objective optimizationproblems. The central characteristic of the model is the use ofpiecewise linearly defined ...
    • The Psychophysiology of Risk Processing and Decision Making at a Regional Stock Exchange 

      Perry, John C. (2007-06-12)
      A longstanding controversy in philosophy is whether decision-making isgoverned by reason or emotion. I study the role of physiologicalresponses in the decision-making process within the realm of financialmarkets, where ...
    • The Quorum Deployment Problem 

      Gilbert, Seth; Malewicz, Grzegorz (2004-10-29)
      Quorum systems are commonly used to maintain the consistency of replicated data in adistributed system. Much research has been devoted to developing quorum systems with good theoreticalproperties, such as fault tolerance ...
    • The Satisfiability Threshold of Random 3-SAT Is at Least 3.52 

      Hajiaghayi, MohammadTaghi; Sorkin, Gregory B. (2003-11-20)
      We prove that a random 3-SAT instance with clause-to-variable densityless than 3.52 is satisfiable with high probability.The proof comes through an algorithm which selects (and sets) a variabledepending on its degree and ...
    • The Security Power of the Ballot Box 

      Lepinski, Matt; Izmalkov, Sergei (2005-02-02)
      We show that any function F can be securely evaluated by a protocolwith ballots and a ballot box. That is, N mutually suspicious players,each player possessing a secret input, can use ballots and a ballotbox to jointly ...
    • The Symmetriad: A Journey of Discovery Through the Land of the Polychora 

      Radul, Alexey (2005)
      I devised and implemented a method for constructing regular andsemiregular geometric objects in n-dimensional Euclidean space.Given a finite reflection group (a Coxeter group) G, there is a standard way to give G a group ...
    • The Theory of Timed I/O Automata 

      Kaynor, Dilsun K.; Lynch, Nancy; Segala, Roberto; Vaandrager, Frits (2005-03-02)
      This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed systems.
    • The Theory of Timed I/O Automata 

      Kaynar, Dilsun K.; Lynch, Nancy; Segala, Roberto; Vaandrager, Frits (2003-08-27)
      Revised version -- November 23, 2004.This paper presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed systems.
    • Theoretical Analysis of Geographic Routing in Social Networks 

      Kumar, Ravi; Liben-Nowell, David; Novak, Jasmine; Raghavan, Prabhakar; Tomkins, Andrew (2005-06-03)
      We introduce a formal model for geographic social networks, and introduce the notion of rank-based friendship, in which the probability that a person v is a friend of a person u is inversely proportional to the number of ...
    • Theories in Practice: Easy-to-Write Specifications that Catch Bugs 

      Saff, David; Boshernitsan, Marat; Ernst, Michael D. (2008-01-14)
      Automated testing during development helps ensure that software works according to the test suite. Traditional test suites verify a few well-picked scenarios or example inputs. However, such example-based testing does not ...
    • Throwing Down the Visual Intelligence Gauntlet 

      Tan, Cheston; Leibo, Joel Z; Poggio, Tomaso (2012)
      In recent years, scientific and technological advances have produced artificial systems that have matched or surpassed human capabilities in narrow domains such as face detection and optical character recognition. However, ...