1298 search results - page 103 / 260 » The online set cover problem |
196
click to vote
INFSOF
2008
15 years 6 months ago
2008
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
189
click to vote
ATVA
2011
Springer
14 years 6 months ago
2011
Springer
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
161
click to vote
ESWS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper discusses problems of creating and using ontology library services in production use. One approach to a solution is presented with an online implementation—t...
159
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
188
click to vote
SIAMJO
2008
15 years 6 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....