Sciweavers

994 search results - page 23 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
INFOCOM
2011
IEEE
12 years 11 months ago
Secure and practical outsourcing of linear programming in cloud computing
—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...
Cong Wang, Kui Ren, Jia Wang
CGF
2006
125views more  CGF 2006»
13 years 7 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
COMGEO
2011
ACM
13 years 2 months ago
Covering points by disjoint boxes with outliers
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin...
IPPS
2006
IEEE
14 years 1 months ago
A parallel memetic algorithm applied to the total tardiness machine scheduling problem
This work proposes a parallel memetic algorithm applied to the total tardiness single machine scheduling problem. Classical models of parallel evolutionary algorithms and the gene...
Vinícius Garcia, Paulo M. França, Al...
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 2 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...