Sciweavers

388 search results - page 59 / 78
» Convergence Properties of the K-Means Algorithms
Sort
View
SIAMJO
2002
92views more  SIAMJO 2002»
14 years 11 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni
AMC
2007
115views more  AMC 2007»
14 years 11 months ago
Evolutionary programming based on non-uniform mutation
Abstract–A new evolutionary programming algorithm (NEP) using the non-uniform mutation operator instead of Gaussian or Cauchy mutation operators is proposed. NEP has the merits o...
Xinchao Zhao, Xiao-Shan Gao, Ze-Chun Hu
CORR
2010
Springer
130views Education» more  CORR 2010»
14 years 11 months ago
Discrete Partitioning and Coverage Control for Gossiping Robots
We propose distributed algorithms to automatically deploy a group of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary nonconvex envi...
Joseph W. Durham, Ruggero Carli, Paolo Frasca, Fra...
JMLR
2006
116views more  JMLR 2006»
14 years 11 months ago
Point-Based Value Iteration for Continuous POMDPs
We propose a novel approach to optimize Partially Observable Markov Decisions Processes (POMDPs) defined on continuous spaces. To date, most algorithms for model-based POMDPs are ...
Josep M. Porta, Nikos A. Vlassis, Matthijs T. J. S...
AUTOMATICA
1999
96views more  AUTOMATICA 1999»
14 years 11 months ago
Optimization of kanban-based manufacturing systems
We develop and analyze an algorithm to maximize the throughput of a serial kanbanbased manufacturing system with arbitrary arrival and service process distributions by adjusting t...
Christos G. Panayiotou, Christos G. Cassandras