Sciweavers

4313 search results - page 129 / 863
» Using time travel to diagnose computer problems
Sort
View
123
Voted
STACS
2007
Springer
15 years 10 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
143
Voted
TCS
1998
15 years 4 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
123
Voted
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 4 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
IPPS
1996
IEEE
15 years 8 months ago
Self-Timed Resynchronization: A Post-Optimization for Static Multiprocessor Schedules
In a shared-memory multiprocessor system, it is possible that certain synchronization operations are redundant -that is, their corresponding sequencing requirements are enforced c...
Shuvra S. Bhattacharyya, Sundararajan Sriram, Edwa...
138
Voted
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 8 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller