994 search results - page 48 / 199 » Custom Computing Machines for the Set Covering Problem |
106
click to vote
ATMOS
2007
15 years 2 months ago
2007
We face a real-world train unit assignment problem for an operator running trains in a regional area. Given a set of timetabled train trips, each with a required number of passenge...
124
Voted
ASP
2001
Springer
15 years 5 months ago
2001
Springer
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
114
Voted
SCALESPACE
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Segmentation of images is often posed as a variational problem. As such, it is solved by formulating an energy functional depending on a contour and other image derived t...
88
Voted
IJCNN
2007
IEEE
15 years 7 months ago
2007
IEEE
—The Support Vector Machine is a widely employed machine learning model due to its repeatedly demonstrated superior generalization performance. The Sequential Minimal Optimizatio...
114
click to vote
ESA
2008
Springer
15 years 2 months ago
2008
Springer
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...