2694 search results - page 27 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
69
Voted
TKDE
2002
14 years 9 months ago
2002
We consider the problem of finding a set of attribute values that give a high quality binary segmentation of a database. The quality of a segmentation is defined by an objective fu...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...
PR
2006
14 years 9 months ago
2006
A cross-validation error estimator is obtained by repeatedly leaving out some data points, deriving classifiers on the remaining points, computing errors for these classifiers on ...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we describe and evaluate a fully distributed P2P evolutionary algorithm (EA) with adaptive autonomous selection. Autonomous selection means that decisions regarding ...