Now showing items 284-297 of 297

    • Understanding the challenges of protein flexibility in drug design 

      Antunes, Dinler A.; Devaurs, Didier; Kavraki, Lydia E. (2015)
      Introduction: Protein–ligand interactions play key roles in various metabolic pathways, and the proteins involved in these interactions represent major targets for drug discovery. Molecular docking is widely used to predict ...
    • Understanding Unfulfilled Memory Reuse Potential in Scientific Applications 

      Marin, Gabriel; Mellor-Crummey, John (2007-10-05)
      The potential for improving the performance of data-intensive scientific programs by enhancing data reuse in cache is substantial because CPUs are significantly faster than memory. Traditional performance tools typically ...
    • Uniform Logical Relations 

      Westbrook, Edwin (2011-04-01)
      Strong Normalization (SN) is an important property for intensional constructive type theories such as the Calculus of Inductive Constructions (CiC), the basis for the Coq theorem prover. Not only does SN imply consistency, ...
    • Universal Domains for Sequential Computation 

      Kanneganti, Ramarao (1995-05)
      Classical recursion theory asserts that all conventional programming languages are equally expressive because they can define all partial recursive functions over the natural numbers. However, most real programming languages ...
    • User-Specified and Automatic Data Layout Selection for Portable Performance 

      Karlin, Ian; Keasler, Jeff; McGraw, James R.; Sarkar, Vivek; Sharma, Kamal (2013-04-25)
      This paper describes a new approach to managing array data layouts to optimize performance for scientific codes. Prior research has shown that changing data layouts (e.g., interleaving arrays) can improve performance. ...
    • Using Problem Topology in Parallelization 

      Liebrock, Lorie M. (1994-09)
      Problem topology is the key to efficient parallelization support for partially regular applications. Specifically, problem topology provides the information necessary for automatic data distribution and regular application ...
    • Value-Driven Redundancy Elimination 

      Simpson, Loren Taylor (1996-04)
      Value-driven redundancy elimination is a combination of value numbering and code motion. Value numbering is an optimization that assigns numbers to values in such a way that two values are assigned the same number if the ...
    • Variational Subdivision for Laplacian Splines 

      Warren, Joe; Weimer, Henrik (1997-10-03)
      The fundamental problem of geometric design is the representation of curved shapes. Traditionally such shapes are represented by parametric spline curves, e.g. NURBS, which are defined as the minimizers of variational ...
    • Verification of Fair Transition Systems 

      Kupferman, Orna; Vardi, Moshe Y. (1997-08-27)
      In program verification we check that an implementation meets its specification. Both the specification and the implementation describe the possible behaviors of the program, though at different levels of abstraction. We ...
    • Verification of Open Systems 

      Vardi, Moshe Y. (1998-04-04)
      In computer system design, we distinguish between closed and open systems. A closed system is a system whose behavior is completely determined by the state of the system. An open system is a system that interacts with its ...
    • Well-Founded Touch Optimization for Futures 

      Felleisen, Matthias; Flanagan, Cormac (1994-10-01)
      The future annotations of MultiLisp provide a simple method for taming the implicit parallelism of functional programs, but require touch operations at all placeholder-strict positions of program operations to ensure proper ...
    • Why Is Modal Logic So Robustly Decidable? 

      Vardi, Moshe Y. (1997-04-12)
      In the last 20 years modal logic has been applied to numerous areas of computer science, including artificial intelligence, program verification, hardware verification, database theory, and distributed computing. There are ...
    • Work-First and Help-First Scheduling Policies for Terminally Strict Parallel Programs 

      Barik, Rajkishore; Guo, Yi; Raman, Raghavan; Sarkar, Vivek (2008-11-13)
      Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address space parallel computing. Examples include OpenMP 3.0, Java ...
    • λ group: Using Optics to Take Group Data Delivery in the Datacenter to the Next Degree 

      Bergman, Keren; Ng, T. S. Eugene; Sripanidkulchai, Kunwadee; Wang, Howard; Xia, Yiting (2014-02-17)
      The increasing number of datacenter applications with heavy one-to-many communications has raised the need for an efficient group data delivery solution. This paper presents an unconventional clean-slate architecture called ...