Sciweavers

3796 search results - page 754 / 760
» Presentations by Programmers for Programmers
Sort
View
JOT
2010
97views more  JOT 2010»
13 years 6 months ago
Towards a theory and calculus of aliasing
A theory, graphical notation, mathematical calculus and implementation for finding whether two given expressions can, at execution time, denote references attached to the same obj...
Bertrand Meyer
OOPSLA
2010
Springer
13 years 6 months ago
Concurrency by modularity: design patterns, a case in point
General purpose object-oriented programs typically aren’t embarrassingly parallel. For these applications, finding enough concurrency remains a challenge in program design. To ...
Hridesh Rajan, Steven M. Kautz, Wayne Rowcliffe
PC
2010
196views Management» more  PC 2010»
13 years 6 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 6 months ago
Adding HL7 version 3 data types to PostgreSQL
The HL7 standard is widely used to exchange medical information electronically. As a part of the standard, HL7 defines scalar communication data types like physical quantity, poin...
Yeb Havinga, Willem Dijkstra, Ander de Keijzer
FPL
2010
Springer
124views Hardware» more  FPL 2010»
13 years 5 months ago
Finding System-Level Information and Analyzing Its Correlation to FPGA Placement
One of the more popular placement algorithms for Field Programmable Gate Arrays (FPGAs) is called Simulated Annealing (SA). This algorithm tries to create a good quality placement ...
Farnaz Gharibian, Lesley Shannon, Peter Jamieson