4854 search results - page 596 / 971 » It's the Programming, Stupid |
155
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
214
click to vote
ITP
2010
15 years 8 months ago
2010
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
150
click to vote
CG
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper we review the conventional versions of nullmove pruning, and present our enhancements which allow for a deeper search with greater accuracy. While the conve...
148
click to vote
IWOMP
2010
Springer
15 years 8 months ago
2010
Springer
With the approaching of the many-core era, it becomes more and more difficult for a single OpenMP application to efficiently utilize all the available processor cores. On the other...
187
click to vote
ECLIPSE
2005
ACM
15 years 8 months ago
2005
ACM
Students need to learn testing skills, and using test-driven development on assignments is one way to help students learn. We use a flexible automated grading system called Web-CA...