14165 search results - page 242 / 2833 » The generalized two-server problem |
169
click to vote
WSC
2008
15 years 8 months ago
2008
In this paper, we suggest a linear programming formulation that allows for solving volume and capacity planning problems in semiconductor manufacturing systems. We assume a genera...
157
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
153
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
146
click to vote
NIPS
2001
15 years 7 months ago
2001
Support Vector Machines (SVMs) are currently the state-of-the-art models for many classication problems but they suer from the complexity of their training algorithm which is at l...
141
Voted
WSC
2004
15 years 7 months ago
2004
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...