• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 165
Next 10 →

MEASURES OF INFORMATION IN MULTI-STAGE STOCHASTIC PROGRAMMING ∗

by Francesca Maggioni, Elisabetta Allevi, Marida Bertocchi
"... Abstract. Multistage stochastic programs, which involve sequences of decisions over time, are usually hard to solve in realistically sized problems. In the two-stage case, several approaches based on different levels of available information has been adopted in literature such as the Expected Value ..."
Abstract - Add to MetaCart
, the Multistage Sum of Pairs Expected Values, MSPEV and the Multistage Expectation of Pairs Expected Value, MEPEV by means of the new concept of auxiliary scenario and redefinition of pairs subproblems probability. We show that theorems proved in [2] and [3] for two stage case are valid also in the multi-stage

Terra: A Multi-Stage Language for High-Performance Computing

by Zachary Devito, James Hegarty, Alex Aiken, Pat Hanrahan, Jan Vitek
"... High-performance computing applications, such as auto-tuners and domain-specific languages, rely on generative programming techniques to achieve high performance and portability. However, these systems are often implemented in multiple disparate languages and perform code generation in a separate pr ..."
Abstract - Cited by 15 (5 self) - Add to MetaCart
process from program execution, making certain optimizations difficult to engineer. We leverage a popular scripting language, Lua, to stage the execution of a novel low-level language, Terra. Users can implement optimizations in the high-level language, and use built-in constructs to generate and execute

Neural Networks on GPUs: Restricted Boltzmann Machines

by Daniel L. Ly, Volodymyr Paprotski, Danny Yen , 2009
"... Despite the popularity and success of neural networks in research, the number of resulting commercial or industrial applications have been limited. A primary cause of this lack of adoption is due to the fact that neural networks are usually implemented as software running on general-purpose processo ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
GTX280 GPU, resulting in a computational speed of 672 million connections-per-second and a speed-up of 66-fold over an optimized C++ program running on a 2.83GHz Intel processor.

Hypercubic Storage Layout and Transforms in Arbitrary Dimensions using GPUs and CUDA

by K. A. Hawick, D. P. Playne , 2011
"... Many simulations in the physical sciences are expressed in terms of rectilinear arrays of variables. It is attractive to develop such simulations for use in 1-, 2-, 3- or arbitrary physical dimensions and also in a manner that supports exploitation of data-parallelism on fast modern processing devic ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Many simulations in the physical sciences are expressed in terms of rectilinear arrays of variables. It is attractive to develop such simulations for use in 1-, 2-, 3- or arbitrary physical dimensions and also in a manner that supports exploitation of data-parallelism on fast modern processing

High-Performance Cone Beam Reconstruction Using CUDA Compatible GPUs

by Yusuke Okitsua, Fumihiko Ino, Kenichi Hagiharaa
"... Compute unified device architecture (CUDA) is a software development platform that allows us to run C-like programs on the nVIDIA graphics processing unit (GPU). This paper presents an acceleration method for cone beam reconstruction using CUDA compatible GPUs. The proposed method accelerates the Fe ..."
Abstract - Add to MetaCart
Compute unified device architecture (CUDA) is a software development platform that allows us to run C-like programs on the nVIDIA graphics processing unit (GPU). This paper presents an acceleration method for cone beam reconstruction using CUDA compatible GPUs. The proposed method accelerates

Materials for an exploratory theory of the network society.

by Manuel Castells , Anthony Giddens , Alain Touraine , Anthony Smith , Benjamin Barber , Peter Hall , Roger-Pol Droit , Sophie Watson , Frank Webster , Krishan Kumar , David Lyon , Craig Calhoun , Jeffrey Henderson , Ramon Ramos , Jose E Rodrigues-Ibanez , Jose F Tezanos , Mary Kaldor , Stephen Jones , Christopher Freeman - The British Journal of Sociology , 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, cross-cultural investigation. It permeates most societies in the world, in v ..."
Abstract - Cited by 122 (0 self) - Add to MetaCart
, in uenced by their speci c experience. There is another layer that is folded in production/consumption, experience, power, and culture. This is technology. By technology I mean 'the use of scienti c knowledge to specify ways of doing things in a reproducible manner'. Technology is embodied

Simulation of liddriven cavity flow by parallel implementation of Lattice-Boltzmann method on GPUs

by S. Berat Çelik, Cüneyt Sert - 2nd Internationl Symposium on Computing in Science and Engineering (ISCSE11
"... Abstract. Lattice Boltzmann Method (LBM) is a computational technique used to solve transport problems in thermo-fluidic sciences. When applied to the solution of incompressible flows it shows a number of advantages compared to classical finite volume or finite element based techniques. Its algorith ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
algorithmic structure is very suitable for parallel programming on GPUs, which are today's state-of-the-art technology for parallel computing. In this study, 2D lid-driven cavity problem, which is a standard benchmark problem for fluid flow simulations, is solved using LBM with D2Q9 model and BGK

A Performance Modeling and Optimization Analysis Tool for Sparse-Matrix Vector Multiplication on GPUs

by Ping Guo, Student Member, Liqiang Wang, Po Chen - IEEE Transactions on Parallel and Distributed Systems , 2014
"... Abstract—This paper presents a performance modeling and optimization analysis tool to predict and optimize the performance of sparse matrix-vector multiplication (SpMV) on GPUs. We make the following contributions: (1) We present an integrated analytical and profile-based performance modeling to acc ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
to accurately predict the kernel execution times of CSR, ELL, COO, and HYB SpMV kernels. Our proposed approach is general, and neither limited by GPU programming languages nor restricted to specific GPU architectures. In this paper, we use CUDA-based SpMV kernels and NVIDIA Tesla C2050 for our performance

Approximate Capacity of Gaussian Interference-Relay Networks with Weak Cross Links

by unknown authors
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

A systematic review of search-based testing for non-functional system properties,

by Wasif Afzal , Richard Torkar , Robert Feldt - Information and Software Technology , 2009
"... a b s t r a c t Search-based software testing is the application of metaheuristic search techniques to generate software tests. The test adequacy criterion is transformed into a fitness function and a set of solutions in the search space are evaluated with respect to the fitness function using a me ..."
Abstract - Cited by 61 (2 self) - Add to MetaCart
a b s t r a c t Search-based software testing is the application of metaheuristic search techniques to generate software tests. The test adequacy criterion is transformed into a fitness function and a set of solutions in the search space are evaluated with respect to the fitness function using a
Next 10 →
Results 1 - 10 of 165
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University