203 search results - page 37 / 41 » How Program History Can Improve Code Completion |
JCC
2007
14 years 9 months ago
2007
: We investigate the parallel scaling of the GROMACS molecular dynamics code on Ethernet Beowulf clusters and what prerequisites are necessary for decent scaling even on such clust...
INFORMS
2010
14 years 8 months ago
2010
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...
SIGSOFT
2004
ACM
15 years 2 months ago
2004
ACM
Static program checking tools can find many serious bugs in software, but due to analysis limitations they also frequently emit false error reports. Such false positives can easi...
IWPC
2008
IEEE
15 years 3 months ago
2008
IEEE
Modern software systems are typically large and complex, making comprehension of these systems extremely difficult. Experienced programmers comprehend code by seamlessly processi...
88
Voted
MICRO
2005
IEEE
15 years 3 months ago
2005
IEEE
Clustered machines partition hardware resources to circumvent the cycle time penalties incurred by large, monolithic structures. This partitioning introduces a long inter-cluster ...