Advanced Search
DSpace@MIT

Browsing CSAIL Digital Archive by Title

Research and Teaching Output of the MIT Community

Browsing CSAIL Digital Archive by Title

Sort by: Order: Results:

  • Tucker-Kellogg, Lisa (2004-10-01)
    Throughout biological, chemical, and pharmaceutical research,conformational searches are used to explore the possiblethree-dimensional configurations of molecules. This thesis describesa new systematic method for ...
  • Vaziri, Mandana; Tauber, Joshua A.; Tsai, Michael J.; Lynch, Nancy (2004-07-19)
    The Input/Output (I/O) automaton model developed by Lynch and Tuttle models components in asynchronous concurrentsystems as labeled transition systems. IOA is a precise language for describing I/O automata and for stating ...
  • Gerber, Georg K.; Dowell, Robin D.; Jaakkola, Tommi S.; Gifford, David K. (2007-06-25)
    Table 1 (Supplemental): Summary of recurrent expression programs (EPs) discovered by GeneProgram. The columns are: (1) the EP identifier (an arbitrarily assigned number), (2) the number of genes in the EP, (3) the number ...
  • Gerber, Georg K.; Dowell, Robin D.; Jaakkola, Tommi S.; Gifford, David K. (2007-06-25)
    Table 2 (Supplemental): Complete data for all 100 recurrent expression programs (EPs) discovered by GeneProgram. Each EP has two identifying rows, a list of meta-genes, and a list of significantly enriched GO categories. ...
  • Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; Pereira, Olivier; Segala, Roberto (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 ...
  • Canetti,, Ran; Cheung,, Ling; Kaynar,, Dilsun; Liskov,, Moses; Lynch,, Nancy; Pereira,, Olivier; Segala, Roberto (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 ...
  • Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; Pereira, Olivier; Segala, Roberto (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 ...
  • 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 ...
  • Leonard, John; Barrett, David; How, Jonathan; Teller, Seth; Antone, Matt; Campbell, Stefan; Epstein, Alex; Fiore, Gaston; Fletcher, Luke; Frazzoli, Emilio; Huang, Albert; Jones, Troy; Koch, Olivier; Kuwata, Yoshiaki; Mahelona, Keoni; Moore, David; Moyer, Katy; Olson, Edwin; Peters, Steven; Sanders, Chris; Teo, Justin; Walter, Matthew (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 ...
  • 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 ...
  • 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.
  • Abelson, Hal (2007-05-19)
    This paper traces the genesis of the MIT OpenCourseWare project from its initial strategic precursors in 1999 and 2000, through its launch in 2001 and its subsequent evolution. The story told here illuminates the interplay ...
  • 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, ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
MIT-Mirage