Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
James B. Orlin, Abraham P. Punnen, Andreas S. Schu...
This paper describes a number of general design problems with adventure-like computer games for young children in order to demonstrate the need for specific design guidelines for t...
: The generalized problem of placing n queens on an n-by-n board provides an "embarrassingly parallel" problem for parallel solution. This paper expands on the discussion...
The problem of automatically tuning multiple parameters for pattern recognition Support Vector Machines (SVMs) is considered. This is done by minimizing some estimates of the gener...
Olivier Chapelle, Vladimir Vapnik, Olivier Bousque...
A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented...