14386 search results - page 278 / 2878 » The Chinese Generals Problem |
119
Voted
AIPS
2008
15 years 7 months ago
2008
In this paper, we report on a new solver for large instances of the Disjunctive Temporal Problem (DTP). Our solver is based primarily on the idea of employing "compact" ...
147
click to vote
WSC
2008
15 years 7 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...
140
click to vote
ECAI
2008
Springer
15 years 6 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 ...
135
Voted
SODA
2008
ACM
15 years 6 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...
128
click to vote
NIPS
2001
15 years 6 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...