Reachability testing is a technique for testing concurrent programs. Reachability testing derives test sequences on-the-fly as the testing process progresses, and can be used to sy...
In conventional DHTs, each node is assigned an exclusive slice of identifier space. Simple it is, such arrangement may be rough. In this paper we propose a generic component struc...
Ming Chen, Guangwen Yang, Yongwei Wu, Xuezheng Liu
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woo...
Bug triage, deciding what to do with an incoming bug report, is taking up increasing amount of developer resources in large open-source projects. In this paper, we propose to appl...
Collecting digital materials is time-consuming and can gain from automation. Since each source—and even each acquisition—may involve a separate negotiation of terms, a collecto...
Fillia Makedon, Song Ye, Sheng Zhang, James Ford, ...