Sciweavers

5536 search results - page 1065 / 1108
» Programming Languages for Distributed Applications
Sort
View
SIGSOFT
2008
ACM
14 years 11 months ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su
PPOPP
2009
ACM
14 years 10 months ago
Detecting and tolerating asymmetric races
Because data races represent a hard-to-manage class of errors in concurrent programs, numerous approaches to detect them have been proposed and evaluated. We specifically consider...
Paruj Ratanaworabhan, Martin Burtscher, Darko Kiro...
HPCA
2008
IEEE
14 years 10 months ago
Address-branch correlation: A novel locality for long-latency hard-to-predict branches
Hard-to-predict branches depending on longlatency cache-misses have been recognized as a major performance obstacle for modern microprocessors. With the widening speed gap between...
Hongliang Gao, Yi Ma, Martin Dimitrov, Huiyang Zho...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
CSCW
2010
ACM
14 years 7 months ago
Are you having difficulty?
It would be useful if software engineers/instructors could be aware that remote team members/students are having difficulty with their programming tasks. We have developed an appr...
Jason Carter, Prasun Dewan
« Prev « First page 1065 / 1108 Last » Next »