Now showing items 1297-1316 of 3804

    • First Class Copy & Paste 

      Edwards, Jonathan (2006-05-22)
      The Subtext project seeks to make programming fundamentally easier by altering the nature of programming languages and tools. This paper defines an operational semantics for an essential subset of the Subtext language. It ...
    • First Version of a Data Flow Procedure Language 

      Dennis, Jack B. (1975-05)
      A language for representing computational procedures based on the concept of data flow is presented in terms of a semantic model that permits concurrent execution of noninterfering program parts. Procedures in the language ...
    • Fixed Parameter Algorithms for Minor-Closed Graphs (of Locally Bounded Treewidth) 

      Demaine, Erik D.; Hajiaghayi, Mohammad Taghi (2003-06)
      Frick and Grohe showed that for each property phi that is definable in first-order logic, and for each class of minor-closed graphs of locally bounded treewidth, there is an O(n^(1+epsilon))-time algorithm deciding whether ...
    • Flavors: Message Passing in the Lisp Machine 

      Weinreb, Daniel; Moon, David (1980-11-01)
      The object oriented programming style used in the Smalltalk and Actor languages is available in Lisp Machine Lisp, and used by the Lisp Machine software system. It is used to perform generic operations on objects. Part ...
    • Fleets: Scalable Services in a Factored Operating System 

      Wentzlaff, David; Gruenwald, Charles, III; Beckmann, Nathan; Belay, Adam; Kasture, Harshad; e.a. (2011-03-09)
      Current monolithic operating systems are designed for uniprocessor systems, and their architecture reflects this. The rise of multicore and cloud computing is drastically changing the tradeoffs in operating system design. ...
    • Flexibility and Efficiency in a Computer Program for Designing Circuits 

      Mcdermott, Drew Vincent (1977-06-01)
      This report is concerned with the problem of achieving flexibility (additivity, modularity) and efficiency (performance, expertise) simultaneously in one AI program. It deals with the domain of elementary electronic circuit ...
    • Flexible Execution of Plans with Choice and Uncertainty 

      Conrad, Patrick R; Williams, Brian C (2011-01-15)
      Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties, while improving robustness and reducing the need for an overly conservative plan. Executives have improved robustness by expanding ...
    • Flexible MIPS Soft Processor Architecture 

      Carli, Roberto (2008-06-16)
      The flexible MIPS soft processor architecture borrows selected technologies from high-performance computing to deliver a modular, highly customizable CPU targeted towards FPGA implementations for embedded systems; the ...
    • FLIP - A Format List Processor 

      Teitelman, Warren (1967-07-01)
      This memo describes a notion of programming language for expressing, from within a LISP system, string manipulation such as those performed in COMIT. The COMIT formalism has been extended in several ways: the patterns (the ...
    • Flowtune: Flowlet Control for Datacenter Networks 

      Perry, Jonathan; Balakrishnan, Hari; Shah, Devavrat (2016-08-15)
      Rapid convergence to a desired allocation of network resources to endpoint traffic has been a long-standing challenge for packet-switched networks. The reason for this is that congestion control decisions are distributed ...
    • Floyd-Hoare Logic Defines Semantics 

      Meyer, Albert R. (1986-05)
      The first-order patrial correctness assertions provable in Floyd-Hoare logic about an uninterpreted while-program scheme determine the scheme up to equivalence. This settles an open problem of Meyer and Halpern. The simple ...
    • Floyd-Hoare Verifiers "Considered Harmful" 

      Shrobe, Howard E. (1978-01-01)
      The Floyd-Hoare methodology completely dominates the field of program verification and has contributed much to our understanding of how programs might be analyzed. Useful but limited verifiers have been developed using ...
    • Fluorescence Assay for Polymerase Arrival Rates 

      Che, Austin (2003-08-31)
      To engineer complex synthetic biological systems will require modulardesign, assembly, and characterization strategies. The RNApolymerase arrival rate (PAR) is defined to be the rate that RNApolymerases arrive at a specified ...
    • Fluorescence Assay for Polymerase Arrival Rates 

      Che, Austin (2003-08-31)
      To engineer complex synthetic biological systems will require modular design, assembly, and characterization strategies. The RNA polymerase arrival rate (PAR) is defined to be the rate that RNA polymerases arrive at a ...
    • Focusing 

      Horn, B.K.P. (1968-05-01)
      This memo describes a method of automatically focusing the new vidisector (TVC). The same method can be used for distance measuring. Included are instructions describing the use of a special LISP and the required LISP-functions. ...
    • Force Feedback in Precise Assembly Tasks 

      Inoue, Hirochika (1974-08-01)
      This paper describes the execution of precise assembly tasks by a robot. The level of performance of the experimental system allows such basic actions as putting a peg into a hole, screwing a nut on a bolt, and picking ...
    • Forecasting Global Temperature Variations by Neural Networks 

      Miyano, Takaya; Girosi, Federico (1994-08-01)
      Global temperature variations between 1861 and 1984 are forecast usingsregularization networks, multilayer perceptrons and linearsautoregression. The regularization network, optimized by stochasticsgradient descent associated ...
    • Form and Content in Computer Science 

      Minsky, Marvin (1969-12-01)
      The trouble with computer science today is an obsessive concern with form instead of content. This essay has three parts, suggesting form-content displacements in Theory of Computation in Programming languages and in Education.
    • A Formal Model of Non-Determinate Dataflow Computation 

      Brock, Jarvis Dean (1983-08)
      Almost ten years ago, Gilles Kahn used the fixed point theory of Dana Scott to define a formal and elegant model of computation for determinate dataflow graphs, networks of determinate processes communicating asynchronously ...
    • Formal Multilevel Hierarchical Verification of Synchronous MOS Circuits 

      Weise, Daniel Wayne (1987-06-01)
      I have designed and implemented a system for the multilevel verification of synchronous MOS VLSI circuits. The system, called Silica Pithecus, accepts the schematic of an MOS circuit and a specification of the circuit's ...