Sciweavers

3019 search results - page 317 / 604
» Approximating the Domatic Number
Sort
View
ESE
1998
131views Database» more  ESE 1998»
15 years 6 months ago
A Comparison of Tool-Based and Paper-Based Software Inspection
Software inspection is an e ective method of defect detection. Recent research activity has considered the development of tool support to further increase the e ciency and e ectiv...
F. MacDonald, J. Miller
MFCS
2010
Springer
15 years 5 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
IPPS
2010
IEEE
15 years 4 months ago
Attack-resistant frequency counting
We present collaborative peer-to-peer algorithms for the problem of approximating frequency counts for popular items distributed across the peers of a large-scale network. Our alg...
Bo Wu, Jared Saia, Valerie King
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
15 years 4 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
16 years 7 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani