Sciweavers

2989 search results - page 66 / 598
» Using Domain-Independent Problems for Introducing Formal Met...
Sort
View
STACS
2007
Springer
15 years 3 months ago
Cost Sharing Methods for Makespan and Completion Time Scheduling
Abstract. Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimiz...
Janina A. Brenner, Guido Schäfer
WETICE
2000
IEEE
15 years 2 months ago
The Mechanics of Collaboration: Developing Low Cost Usability Evaluation Methods for Shared Workspaces
We introduce a conceptual framework that articulates the mechanics of collaboration for shared-workspace groupware: the low level actions and interactions that must be carried out...
Carl Gutwin, Saul Greenberg
IPCO
2001
166views Optimization» more  IPCO 2001»
14 years 11 months ago
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
Fabián A. Chudak, Tim Roughgarden, David P....
VIROLOGY
2008
121views more  VIROLOGY 2008»
14 years 9 months ago
Constructing malware normalizers using term rewriting
A malware mutation engine is able to transform a malicious program to create a different version of the program. Such mutation engines are used at distribution sites or in self-pro...
Andrew Walenstein, Rachit Mathur, Mohamed R. Chouc...
ICALP
2009
Springer
15 years 10 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams