2300 search results - page 260 / 460 » Maximally Concurrent Programs |
200
click to vote
EUROSYS
2010
ACM
16 years 3 months ago
2010
ACM
Debugging real systems is hard, requires deep knowledge of the code, and is time-consuming. Bug reports rarely provide sufficient information, thus forcing developers to turn int...
188
click to vote
PLDI
2004
ACM
16 years 11 hour ago
2004
ACM
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...
264
click to vote
SIGSOFT
2010
ACM
15 years 4 months ago
2010
ACM
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
228
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
167
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta-)reasoning about the approximation width of variables. Semantics for linear...