Sciweavers

1298 search results - page 33 / 260
» The online set cover problem
Sort
View
CORR
2006
Springer
160views Education» more  CORR 2006»
14 years 9 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
QSIC
2003
IEEE
15 years 2 months ago
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
Christine Cheng, Adrian Dumitrescu, Patrick J. Sch...
FOCM
2010
97views more  FOCM 2010»
14 years 8 months ago
Self-Concordant Barriers for Convex Approximations of Structured Convex Sets
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
Levent Tunçel, Arkadi Nemirovski
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 3 months ago
Optimal nesting of species for exact cover of resources: two against many
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...
Jeffrey Horn
CGF
2006
125views more  CGF 2006»
14 years 9 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels