Sciweavers

666 search results - page 31 / 134
» The Pipelined Set Cover Problem
Sort
View
FOCM
2010
97views more  FOCM 2010»
13 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»
14 years 4 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»
13 years 10 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
SBCCI
2005
ACM
185views VLSI» more  SBCCI 2005»
14 years 3 months ago
Automatic generation of test sets for SBST of microprocessor IP cores
Higher integration densities, smaller feature lengths, and other technology advances, as well as architectural evolution, have made microprocessor cores exceptionally complex. Cur...
Ernesto Sánchez, Matteo Sonza Reorda, Giova...
BMCBI
2008
104views more  BMCBI 2008»
13 years 10 months ago
ReRep: Computational detection of repetitive sequences in genome survey sequences (GSS)
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
Thomas D. Otto, Leonardo H. F. Gomes, Marcelo Alve...