8413 search results - page 396 / 1683 » Ordering Problem Subgoals |
160
click to vote
CP
2004
Springer
16 years 2 days ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
172
click to vote
ALENEX
2009
15 years 4 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
188
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
185
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
167
click to vote
COR
2007
15 years 6 months ago
2007
We studied a supplier selection problem, where a buyer, while facing random demand, is to decide ordering quantities from a set of suppliers with different yields and prices.We pr...