2254 search results - page 8 / 451 » Computing the minimal covering set |
109
click to vote
FOCS
2005
IEEE
15 years 5 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 ...
104
click to vote
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
ICDT
2005
ACM
15 years 5 months ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
FSTTCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
STACS
2012
Springer
13 years 7 months ago
2012
Springer
