Sciweavers

6102 search results - page 468 / 1221
» Generating Optimizing Specializers
Sort
View
132
Voted
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 8 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
137
Voted
DAS
2006
Springer
15 years 6 months ago
Extraction and Analysis of Document Examiner Features from Vector Skeletons of Grapheme 'th'
Abstract. This paper presents a study of 25 structural features extracted from samples of grapheme `th' that correspond to features commonly used by forensic document examiner...
Vladimir Pervouchine, Graham Leedham
130
Voted
ATMOS
2007
152views Optimization» more  ATMOS 2007»
15 years 6 months ago
Solution of the Train Platforming Problem
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
Alberto Caprara, Laura Galli, Paolo Toth
ECAI
2010
Springer
15 years 5 months ago
EP for Efficient Stochastic Control with Obstacles
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...
Thomas Mensink, Jakob J. Verbeek, Bert Kappen
163
Voted
AUTOMATICA
2007
124views more  AUTOMATICA 2007»
15 years 4 months ago
Motion planning in uncertain environments with vision-like sensors
In this work we present a methodology for intelligent path planning in an uncertain environment using vision like sensors, i.e., sensors that allow the sensing of the environment ...
Suman Chakravorty, John L. Junkins