Sciweavers

951 search results - page 9 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 3 months ago
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
Rahul Jain, Hartmut Klauck, Miklos Santha
92
Voted
CG
2006
Springer
15 years 7 months ago
Comparative Study of Approximate Strategies for Playing Sum Games Based on Subgame Types
Cherif R. S. Andraos, Manal M. Zaky, Salma A. Ghon...
STACS
2012
Springer
13 years 11 months ago
Preemptive and Non-Preemptive Generalized Min Sum Set Cover
Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan
FOCS
2007
IEEE
15 years 9 months ago
Non-Preemptive Min-Sum Scheduling with Resource Augmentation
Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kir...