56 search results - page 2 / 12 » How good are interior point methods |
AAAI
2004
13 years 6 months ago
2004
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
VCIP
2003
13 years 6 months ago
2003
The study presented in this paper analyses descriptions extracted with MPEG-7-descriptors from visual content from the statistical point of view. Good descriptors should generate ...
COLT
2008
Springer
13 years 7 months ago
2008
Springer
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
CG
2006
Springer
13 years 5 months ago
2006
Springer
The investigation of molecular structures often requires the use of graphics software to display different representations of the molecule of interest. Unfortunately, the commonly...
COMPGEOM
1993
ACM
13 years 9 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...