Now showing items 3380-3399 of 3804

    • A T=0(2^n/2), S=0(2^n/4) Algorithm for Certain NP-Complete Problems 

      Schroeppel, Richard; Shamir, Adi (1980-01)
      In this paper we develop a general prupose algorithm that can solve a number of NP-complete problems in time T=0(2^n/2) and space S=0(2^n/4). The algorithm can be generalized to a family of algorithms whose time and space ...
    • Table 1 (Supplemental): Summary of expression programs discovered by GeneProgram from Novartis Tissue Atlas v2 data 

      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 ...
    • Table 2 (Supplemental): Complete data for all 100 expression programs discovered by GeneProgram from the Novartis Gene Atlas v2 

      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. ...
    • Tactile Recognition and Localization Using Object Models: The Case of Polyhedra on a Plane 

      Gaston, Peter C.; Lozano-Perez, Tomaso (1983-03-01)
      This paper discusses how data from multiple tactile sensors may be used to identify and locate one object, from among a set of known objects. We use only local information from sensors: (1) the position of contact ...
    • Talking to the Puma 

      Sobalvarro, Patrick G. (MIT Artificial Intelligence Laboratory, 1982-09)
      The AI Lab's Unimation Puma 600 is a general-purpose industrial robot arm that has been interfaced to a Lisp Machine for use in robotics projects at the lab. It has been fitted with a force-sensing wrist. The Puma is capable ...
    • Taming Chaotic Circuits 

      Bradley, Elizabeth (1992-09-01)
      Control algorithms that exploit chaotic behavior can vastly improve the performance of many practical and useful systems. The program Perfect Moment is built around a collection of such techniques. It autonomously ...
    • Task and Object Learning in Visual Recognition 

      Edelman, Shimon; Heinrich Bulthoff,; Sklar, Erik (1991-01-01)
      Human performance in object recognition changes with practice, even in the absence of feedback to the subject. The nature of the change can reveal important properties of the process of recognition. We report an ...
    • Task Scheduling in the Control Robotics Environment 

      Mok, Aloysius Ka-Lau (1976-09)
      Scheduling problems involved in Control Robotics, a software approach to control engineering are studied. The capability of a multiprocessor system to handle tasks with hard, real-time deadlines is investigated according ...
    • Task-Level Robot Learning 

      Aboaf, Eric W. (1988-08-01)
      We are investigating how to program robots so that they learn from experience. Our goal is to develop principled methods of learning that can improve a robot's performance of a wide range of dynamic tasks. We have ...
    • Task-Level Robot Learning: Ball Throwing 

      Aboaf, Eric W.; Atkeson, Christopher G.; Reinkensmeyer, David J. (1987-12-01)
      We are investigating how to program robots so that they learn tasks from practice. One method, task-level learning, provides advantages over simply perfecting models of the robot's lower level systems. Task-level ...
    • 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 ...
    • 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 ...
    • Taxonomic Syntax for First-Order Inference 

      McAllester, David; Givan, Robert (1989-06-01)
      Most knowledge representation languages are based on classes and taxonomic relationships between classes. Taxonomic hierarchies without defaults or exceptions are semantically equivalent to a collection of formulas ...
    • 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 ...
    • TCP Packet Trace Analysis 

      Shepard, Timothy Jason (1991-02)
      Examination of a trace of packets collected from the network is often the only method available for diagnosing protocol performance problems in computer networks. This thesis explores the use of packet traces to diagnose ...
    • TCP-friendly Congestion Control for Real-time Streaming Applications 

      Bansal, Deepak; Balakrishnan, Hari (2000-05)
      This paper introduces and analyzes a class of nonlinear congestion control algorithms called binomial algorithms, motivated in part by the needs of streaming audio and video applications for which a drastic reduction in ...
    • Teacher's Guide for Computational Models of Animal Behavior 

      Abelson, Hal; Goldenberg, Paul (1977-04-01)
      This is an experimental curriculum unit which suggests how the computational perspective can be integrated into a subject such as elementary school biology. In order to illustrate the interplay of computer and non-computer ...
    • Teaching an Old Robot New Tricks: Learning Novel Tasks via Interaction with People and Things 

      Marjanovic, Matthew J. (2003-06-20)
      As AI has begun to reach out beyond its symbolic, objectivist roots into the embodied, experientialist realm, many projects are exploring different aspects of creating machines which interact with and respond to the world ...
    • Teaching Children Thinking 

      Papert, Seymour A. (1971-10-01)
      This paper is dedicated to the hope that someone with power to act will one day see that contemporary research on education is like the following experiment by a nineteenth century engineer who worked to demonstrate that ...