641 search results - page 38 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
145
click to vote
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
15 years 6 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
104
Voted
ICRA
2003
IEEE
15 years 7 months ago
2003
IEEE
- The performance of monocular vision based target tracking is a strong function of camera motion. Without motion, the target estimation problem is unsolvable. By designing the cam...
124
click to vote
GMP
2008
IEEE
15 years 1 months ago
2008
IEEE
We perform collision detection between static rigid objects using a bounding volume hierarchy which consists of an oriented bounding box (OBB) tree enhanced with bounding spheres. ...
105
Voted
COLT
2008
Springer
15 years 3 months ago
2008
Springer
We show how models for prediction with expert advice can be defined concisely and clearly using hidden Markov models (HMMs); standard HMM algorithms can then be used to efficientl...
NIPS
2003
15 years 3 months ago
2003
We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a cla...