664 search results - page 8 / 133 » Solution to the Counterfeit Coin Problem and its Generalizat... |
ALT
2004
Springer
14 years 5 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
ICCV
1999
IEEE
14 years 10 months ago
1999
IEEE
We consider the problem of reconstructing the 3D coordinates of a moving point seen from a monocular moving camera, i.e., to reconstruct moving objects from line-of-sight measurem...
AAAI
1997
13 years 9 months ago
1997
Difficult real-time AI problems require a means for expressing multi-dimensional and dynamic goal criteria and a principled model for satisficing to best meet the criteria. In the...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
CG
2002
Springer
13 years 8 months ago
2002
Springer
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...