Sciweavers

3049 search results - page 84 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICRA
2010
IEEE
102views Robotics» more  ICRA 2010»
15 years 2 months ago
A fast n-dimensional ray-shooting algorithm for grasping force optimization
We present an efficient algorithm for solving the ray-shooting problem on high dimensional sets. Our algorithm computes the intersection of the boundary of a compact convex set w...
Yu Zheng, Ming C. Lin, Dinesh Manocha
CEC
2008
IEEE
15 years 11 months ago
Analysis of reproduction operator in Bacterial Foraging Optimization Algorithm
— One of the major driving forces of Bacterial Foraging Optimization Algorithm (BFOA) is the reproduction phenomenon of virtual bacteria each of which models one trial solution o...
Ajith Abraham, Arijit Biswas, Sambarta Dasgupta, S...
CDC
2008
IEEE
150views Control Systems» more  CDC 2008»
15 years 11 months ago
Subgradient methods and consensus algorithms for solving convex optimization problems
— In this paper we propose a subgradient method for solving coupled optimization problems in a distributed way given restrictions on the communication topology. The iterative pro...
Björn Johansson, Tamás Keviczky, Mikae...
NIPS
2003
15 years 5 months ago
Feature Selection in Clustering Problems
A novel approach to combining clustering and feature selection is presented. It implements a wrapper strategy for feature selection, in the sense that the features are directly se...
Volker Roth, Tilman Lange
EOR
2008
78views more  EOR 2008»
15 years 4 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