Sciweavers

1033 search results - page 85 / 207
» The Relative History Heuristic
Sort
View
NIPS
2004
15 years 1 months ago
Breaking SVM Complexity with Cross-Training
We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure ...
Gökhan H. Bakir, Léon Bottou, Jason We...
CORR
2010
Springer
148views Education» more  CORR 2010»
14 years 12 months ago
Approximability of the Multiple Stack TSP
STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notabl...
Sophie Toulouse
CORR
2010
Springer
118views Education» more  CORR 2010»
14 years 12 months ago
alphaCertified: certifying solutions to polynomial systems
Smale's -theory uses estimates related to the convergence of Newton's method to give criteria implying that Newton iterations will converge quadratically to solutions to ...
Jonathan D. Hauenstein, Frank Sottile
MOC
2002
109views more  MOC 2002»
14 years 11 months ago
The parallelized Pollard kangaroo method in real quadratic function fields
Abstract. We show how to use the parallelized kangaroo method for computing invariants in real quadratic function fields. Specifically, we show how to apply the kangaroo method to ...
Andreas Stein, Edlyn Teske
JGO
2010
138views more  JGO 2010»
14 years 10 months ago
Continuous GRASP with a local active-set method for bound-constrained global optimization
Abstract. Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic – based on th...
Ernesto G. Birgin, Erico M. Gozzi, Mauricio G. C. ...