Sciweavers

6592 search results - page 1172 / 1319
» On robust cycle bases
Sort
View
INFORMS
2000
128views more  INFORMS 2000»
15 years 6 months ago
A Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization
We develop a variant of the Nelder-Mead (NM) simplex search procedure for stochastic simulation optimization that is designed to avoid many of the weaknesses encumbering such dire...
David G. Humphrey, James R. Wilson
JAR
2000
123views more  JAR 2000»
15 years 6 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle
PR
2000
158views more  PR 2000»
15 years 6 months ago
Applying deformable templates for cell image segmentation
This paper presents an automatic method, based on the deformable template approach, for cell image segmentation under severe noise conditions. We de"ne a new methodology, div...
Antonio Garrido Carrillo, Nicolas Pérez de ...
RAS
2000
170views more  RAS 2000»
15 years 6 months ago
Visual servoing and appearance for navigation
We address the problem of visual-based navigation of a mobile robot in indoors environments. The robot control system is based on a single camera to provide the required visual fe...
Raquel Frizera Vassallo, Hans J. Schneebeli, Jos&e...
IDA
2002
Springer
15 years 6 months ago
Boosting strategy for classification
This paper introduces a strategy for training ensemble classifiers by analysing boosting within margin theory. We present a bound on the generalisation error of ensembled classifi...
Huma Lodhi, Grigoris J. Karakoulas, John Shawe-Tay...
« Prev « First page 1172 / 1319 Last » Next »