Sciweavers

1110 search results - page 190 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
ATAL
2007
Springer
15 years 4 months ago
Scaling-up shopbots: a dynamic allocation-based approach
In this paper we consider the problem of eCommerce comparison shopping agents (shopbots) that are limited by capacity constraints. In light of the phenomenal increase both in dema...
David Sarne, Sarit Kraus, Takayuki Ito
IMC
2005
ACM
15 years 4 months ago
The Power of Slicing in Internet Flow Measurement
Flow measurement evolved into the primary method for measuring the composition of Internet traffic. Large ISPs and small networks use it to track dominant applications, dominant ...
Ramana Rao Kompella, Cristian Estan
CORR
2010
Springer
86views Education» more  CORR 2010»
14 years 10 months ago
Online Scheduling on Identical Machines using SRPT
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
Kyle Fox, Benjamin Moseley
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
15 years 11 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
BMCBI
2007
136views more  BMCBI 2007»
14 years 10 months ago
Reduced modeling of signal transduction - a modular approach
Background: Combinatorial complexity is a challenging problem in detailed and mechanistic mathematical modeling of signal transduction. This subject has been discussed intensively...
Markus Koschorreck, Holger Conzelmann, Sybille Ebe...