Results 1  10
of
444
On Minimizing RegressionSuites using OnLine SetCover
, 1997
"... This paper is about the experience gained in IBM Haifa Research Lab (HRL) in creating regressionsuites and minimizing their size, while maintaining high quality as measured by coverage. The problem that we solve, while similar to the one addressed in the literature, has a key difference; the com ..."
Abstract
 Add to MetaCart
; the compaction algorithm has to be implemented online due to the large number of tests processed. We compare strategies for implementing online setcover. The tradeoffs are between quality of solution (as expressed by the size of the test suite), memory and CPU. We show that online compaction strategies
Greedy Algorithms for onLine SetCovering and Related Problems
, 2006
"... We study the following online model for setcovering: elements of a ground set of size n arrive onebyone and with any such element c i , arrives also the name of some set S i 0 containing c i and covering the most of the uncovered ground setelements (obviously, these elements have not been yet r ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study the following online model for setcovering: elements of a ground set of size n arrive onebyone and with any such element c i , arrives also the name of some set S i 0 containing c i and covering the most of the uncovered ground setelements (obviously, these elements have not been yet
Competitive Algorithms for Online Set Cover or How to Beat Murphy's Law
"... This paper considers an online optimization version of the set cover problem. We present a optimally competitive online randomized algorithm which is O(logn log m) competitive where n is the maximum number of sets and m is maximum the number of elements. Moreover, we provide a matching lower boun ..."
Abstract
 Add to MetaCart
This paper considers an online optimization version of the set cover problem. We present a optimally competitive online randomized algorithm which is O(logn log m) competitive where n is the maximum number of sets and m is maximum the number of elements. Moreover, we provide a matching lower
Online Choice of Online Algorithms
, 1993
"... Let fA1 ; A2 ; : : : ; Amg be a set of online algorithms for a problem P with input set I. We assume that P can be represented as a metrical task system. Each A i has a competitive ratio a i with respect to the optimum offline algorithm, but only for a subset of the possible inputs such that the un ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
Let fA1 ; A2 ; : : : ; Amg be a set of online algorithms for a problem P with input set I. We assume that P can be represented as a metrical task system. Each A i has a competitive ratio a i with respect to the optimum offline algorithm, but only for a subset of the possible inputs
The Online Set Cover Problem
 STOC'03
, 2003
"... Let X = {1, 2,...,n} be a ground set of n elements, and let S be a family of subsets of X, S  = m, with a positive cost cS associated with each S ∈S. Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary. An adversary gives eleme ..."
Abstract

Cited by 64 (7 self)
 Add to MetaCart
Let X = {1, 2,...,n} be a ground set of n elements, and let S be a family of subsets of X, S  = m, with a positive cost cS associated with each S ∈S. Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary. An adversary gives
OnLine kCovering
"... An O(n 2 (n\Gammak)) online algorithm for computing a minimum set of kcovers for a given string of length n is presented. A straightforward modification of the algorithms yields O(kn 2 (n \Gamma k)) algorithms for computing a minimum set of kcovers and ksegments for a given circular string ..."
Abstract
 Add to MetaCart
An O(n 2 (n\Gammak)) online algorithm for computing a minimum set of kcovers for a given string of length n is presented. A straightforward modification of the algorithms yields O(kn 2 (n \Gamma k)) algorithms for computing a minimum set of kcovers and ksegments for a given circular string
its online assessment
"... [1] Nowadays none of the operational daily forecasts in Europe includes the influence of Saharan dust on a nonclimatic basis. In order to account for this, the BSCCNS currently operates daily photochemical forecasts in the Iberian Peninsula with MM5EMEPCMAQ modelling system and Saharan dust forec ..."
Abstract
 Add to MetaCart
/DREAM is added online to the anthropogenic output of CMAQ. The performance of the model has been quantitatively evaluated with discrete and categorical (skill scores) statistics by a fully operational online comparison of the firstlayer simulations results of CMAQ and CMAQ+DREAM and the values measured in two
Online Variable Sized Covering
 Inform. and Comput
, 2001
"... We consider onedimensional and multidimensional vector covering with variable sized bins. In the onedimensional case, we consider variable sized bin covering with bounded item sizes. For every finite set of bins B, and upper bound 1=m on the size of items for some integer m, we defie a ratio r(B; ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(B; m). We prove this is the best possible competitive ratio for the set of bins B and the parameter m, by giving both an algorithm with competitive ratio r(B; m), and an upper bound of r(B; m) on the competitive ratio of any online deterministic or randomized algorithm. The ratio satisfies r(B; m) m
The Online Set Cover Problem
"... Let X = {1, 2,..., n} be a ground set of n elements, and let S be a family of subsets of X, S  = m, with a positive cost cS associated with each S ∈ S. Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary. An adversary gives ele ..."
Abstract
 Add to MetaCart
Let X = {1, 2,..., n} be a ground set of n elements, and let S be a family of subsets of X, S  = m, with a positive cost cS associated with each S ∈ S. Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary. An adversary gives
Results 1  10
of
444