Sciweavers

4229 search results - page 110 / 846
» On the Optimality of Spiral Search
Sort
View
CIRA
2007
IEEE
274views Robotics» more  CIRA 2007»
16 years 21 days ago
Adaptive Object Tracking using Particle Swarm Optimization
—This paper presents an automatic object detection and tracking algorithm by using particle swarm optimization (PSO) based method, which is a searching algorithm inspired by the ...
Yuhua Zheng, Yan Meng
CEC
2007
IEEE
15 years 10 months ago
Ranking-Dominance and Many-Objective Optimization
An alternative relation to Pareto-dominance is studied. The relation is based on ranking a set of solutions according to each separate objective and an aggregation function to calc...
Saku Kukkonen, Jouni Lampinen
AAAI
2007
15 years 8 months ago
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively gui...
Patrik Haslum, Adi Botea, Malte Helmert, Blai Bone...
EOR
2008
78views more  EOR 2008»
15 years 6 months ago
Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
Haye Lau, Shoudong Huang, Gamini Dissanayake
JMLR
2010
143views more  JMLR 2010»
15 years 4 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...