Sciweavers

861 search results - page 94 / 173
» Polymorphic Time Systems for Estimating Program Complexity
Sort
View
ITICSE
1997
ACM
14 years 1 months ago
Recursion and grammars for CS2
A programming exercise on recursion in which students create drawings of simple and bracketed Lindenmayer Systems provides a context for exploring additional computer science conc...
Viera K. Proulx
ENTCS
2008
125views more  ENTCS 2008»
13 years 9 months ago
Can Refinement be Automated?
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
Peter Höfner, Georg Struth
GI
2009
Springer
13 years 6 months ago
Implementation of an effective non-bonded interactions kernel for biomolecular simulations on the Cell processor
Abstract: In biomolecular simulations intensive computations are spent in nonbonded interactions kernels, i.e., electrostatic interactions. Therefore this part can be considered as...
Horacio Emilio Pérez Sánchez, Wolfga...
TWC
2010
13 years 3 months ago
Beamforming in MISO Systems: Empirical Results and EVM-Based Analysis
We present an analytical, simulation, and experimental-based study of beamforming Multiple Input Single Output (MISO) systems. We analyze the performance of beamforming MISO syste...
Melissa Duarte, Ashutosh Sabharwal, Chris Dick, Ra...
PLDI
2011
ACM
12 years 11 months ago
Automatic CPU-GPU communication management and optimization
The performance benefits of GPU parallelism can be enormous, but unlocking this performance potential is challenging. The applicability and performance of GPU parallelizations is...
Thomas B. Jablin, Prakash Prabhu, James A. Jablin,...