Now showing items 180-199 of 297

    • Object-oriented Programming Languages Need Well-founded Contracts 

      Felleisen, Matthias; Findler, Robert Bruce; Latendresse, Mario (2001-01-01)
      Over the past few years, the notion of building software from components has become popular again. The goal is to produce systems by adapting and linking off-the-shelf modules from a pool of interchangeable components. To ...
    • Object-Oriented Type Inference for Telescoping Languages 

      Allen, Eric; Kennedy, Ken; McCosh, Cheryl (2004)
      The telescoping-languages approach achieves high performance from applications encoded as high-level scripts. The core idea is to pre-compile underlying libraries to generate multiple variants optimized for use indifferent ...
    • On computing minimal independent support and its applications to sampling and counting 

      Ivrii, Alexander; Malik, Sharad; Meel, Kuldeep S.; Vardi, Moshe Y. (2015)
      Constrained sampling and counting are two fundamental problems arising in domains ranging from artificial intelligence and security, to hardware and software testing. Recent approaches to approximate solutions for these ...
    • On Flexible Docking Using Expansive Search 

      Heath, Allison; Kavraki, Lydia E.; Moll, Mark; Schwarz, David (2005-02-22)
      The activity of most drugs is regulated by the binding of one molecule(the ligand) to a pocket of another, usually larger, molecule, which is commonly a protein. This report describes a new approach to creating low-energy ...
    • On-Line and Dynamic Algorithms for Shortest Path Problems 

      Djidjev, Hristo N. (2005-06-01)
      We describe algorithms for finding shortest paths and distances in aplanar digraph which exploit the particular topology of the input graph. An important feature of our algorithms is that they can work in a dynamic ...
    • Once and For All 

      Kupferman, Orna; Pnueli, Amir; Vardi, Moshe Y. (2012)
      It has long been known that past-time operators add no expressive power to linear temporal logics. In this paper, we consider the extension of branching temporal logics with past-time operators. Two possible views regarding ...
    • OpenMP on Networks of Workstations 

      Lu, Honghui (2001-01-30)
      The OpenMP Application Programming Interface (API) is an emerging standard for parallel programming on shared memory architectures. Networks of workstations (NOWs) are attractive parallel programming platforms because of ...
    • Operating system support for server applications 

      Banga, Gaurav (1999-05-25)
      General-purpose operating systems provide inadequate support for large-scale servers. Server applications lack sufficient control over scheduling and management of machine resources, which makes it difficult to enforce ...
    • Opportunities and Limits of Remote Timing Attacks 

      Crosby, Scott A.; Riedi, Rudolf H.; Wallach, Dan S. (2007-05-26)
      Many algorithms can take a variable amount of time to complete depending on the data being processed. These timing differences can sometimes disclose confidential information. Indeed, researchers have been able to reconstruct ...
    • Optimizing Energy to Minimize Errors in Approximate Ripple Carry Adders 

      Kedem, Zvi M.; Mooney, Vincent J.; Muntimadugu, Kirthi Krishna; Palem, Krishna V. (2011-07-25)
      We present a theoretical foundation and a methodology for automatically assigning supply voltages to approximate ripple carry adders in which accuracy is traded for energy consumption. The error minimization problem for a ...
    • Optimizing Fortran90D/HPF for Distributed-memory Computers 

      Roth, Gerald H. (1997-05-29)
      High Performance Fortran (HPF), as well as its predecessor FortranD, has attracted considerable attention as a promising language for writing portable parallel programs for a wide variety of distributed-memory architectures. ...
    • Optimizing Programs over the Constructive Reals 

      Lee, Vernon A. (1998-04-08)
      A real number x is constructive if an algorithm can be given to compute arbitrarily accurate approximations to x. An efficient implementation of constructive real arithmetic could be used for prototyping numerical programs, ...
    • Pacer: Taking the Guesswork Out of Live Migrations in Hybrid Cloud Computing 

      Zheng, Jie; Ng, T. S. Eugene; Sripanidkulchai, Kunwadee; Liu, Zhaolei (2013-10-01)
      Hybrid cloud computing, where private and public cloud resources are combined and applications can migrate freely, ushers in unprecedented flexibility for businesses. To unleash the benefits, commercial products already ...
    • Parallel Flow-Sensitive Points-to Analysis 

      Zhao, Jisheng; Burke, Michael G.; Sarkar, Vivek (2017-02-01)
      Points-to analysis is a fundamental requirement for many program analyses, optimizations, and debugging/verification tools. However, finding an effective balance between performance, scalability and precision in points-to ...
    • Parsimonious Inference of Hybridization in the Presence of Incomplete Lineage Sorting 

      Yu, Yun; Barnett, R. Matthew; Nakhleh, Luay (2013)
      Hybridization plays an important evolutionary role in several groups of organisms. A phylogenetic approach to detect hybridization entails sequencing multiple loci across the genomes of a group of species of interest, ...
    • Performance Analysis and Optimization of a Hybrid Seismic Imaging Application 

      Paul, Sri Raj; Araya-Polo, Mauricio; Mellor-Crummey, John; Hohl, Detlef (2016)
      Applications to process seismic data are computationally expensive and, therefore, employ scalable parallel systems to produce timely results. Here we describe our experiences of using performance analysis tools to gain ...
    • Performance Characterization of the FreeBSD Network Stack 

      Kim, Hyong-youb; Rixner, Scott (2005-06-02)
      This paper analyzes the behavior of high-performance web servers along three axes: packet rate, number of connections, and communication latency. Modern, high-performance servers spend a significant fraction of time executing ...
    • Planarization of Graphs Embedded on Surfaces 

      Djidjev, Hristo N.; Venkatesan, Shankar M. (1995-06-02)
      A planarizing set of a graph is a set of edges or vertices whose removal leaves a planar graph. It is shown that if G is an n vertex graph of maximum degree d and orientable genus g, then there exists a planarizing set of ...
    • Plinko: Building Provably Resilient Forwarding Tables 

      Cox, Alan L.; Rixner, Scott; Stephens, Brent (2013-07-18)
      This paper introduces Plinko, a network architecture that uses a novel forwarding model and routing algorithm to build networks with forwarding paths that, assuming arbitrarily large forwarding tables, are provably resilient ...
    • Polymorphism for Imperative Languages without Imperative Types 

      Wright, Andrew (1993-02-18)
      The simple and elegant Hindley/Milner polymorphic type discipline is the basis of the type system of Standard ML, but ML's imperative features are a blight on this otherwise clean landscape. Polymorphism and imperative ...