Sciweavers

7092 search results - page 216 / 1419
» Parallelizing constraint programs
Sort
View
90
Voted
LCPC
2007
Springer
15 years 6 months ago
Concurrency Analysis for Shared Memory Programs with Textually Unaligned Barriers
Yuan Zhang, Evelyn Duesterwald, Guang R. Gao
112
Voted
SIAMCOMP
1998
137views more  SIAMCOMP 1998»
15 years 5 days ago
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
Sridhar Rajagopalan, Vijay V. Vazirani
COR
2011
14 years 4 months ago
Sampled fictitious play for approximate dynamic programming
Marina A. Epelman, Archis Ghate, Robert L. Smith
SIGSOFT
2005
ACM
16 years 1 months ago
Context- and path-sensitive memory leak detection
We present a context- and path-sensitive algorithm for detecting memory leaks in programs with explicit memory management. Our leak detection algorithm is based on an underlying e...
Yichen Xie, Alexander Aiken
ECOOP
2004
Springer
15 years 6 months ago
Transactional Monitors for Concurrent Objects
Transactional monitors are proposed as an alternative to monitors based on mutualexclusion synchronization for object-oriented programming languages. Transactional monitors have e...
Adam Welc, Suresh Jagannathan, Antony L. Hosking