994 search results - page 38 / 199 » Custom Computing Machines for the Set Covering Problem |
171
Voted
NETWORKS
2010
14 years 11 months ago
2010
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be...
111
click to vote
AAAI
2008
15 years 3 months ago
2008
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
87
Voted
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
We present a novel method to enhance training set for face detection with nonlinearly generated examples from the original data. The motivation is from Support Vector Machines (SV...
78
Voted
JMLR
2006
15 years 23 days ago
2006
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...