Sciweavers

7796 search results - page 344 / 1560
» On Generalized Schur Numbers
Sort
View
SIGSOFT
2008
ACM
16 years 7 months ago
Can developer-module networks predict failures?
Software teams should follow a well defined goal and keep their work focused. Work fragmentation is bad for efficiency and quality. In this paper we empirically investigate the re...
Martin Pinzger, Nachiappan Nagappan, Brendan Murph...
SPAA
2009
ACM
16 years 7 months ago
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gib...
ATAL
2009
Springer
16 years 1 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
CANDC
2009
ACM
16 years 1 months ago
Subliminal wiretapping
Subliminal Wiretapping is a subtly interactive artwork that utilizes random number generation modified through mindmatter effects to supply a continuous stream of words. Frequent,...
Shawn Lawson
COCOA
2007
Springer
16 years 1 months ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...