4255 search results - page 51 / 851 » Cover |
KDD
2007
ACM
14 years 10 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
SIGMOD
2002
ACM
14 years 10 months ago
2002
ACM
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
FOSSACS
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
STACS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We develop for set cover games several general cost-sharing methods that are approximately budget-balanced, core, and/or group-strategyproof. We first study the cost sha...