2694 search results - page 228 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
146
click to vote
PPSN
1998
Springer
15 years 10 months ago
1998
Springer
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
173
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
247
click to vote
PROCEDIA
2011
14 years 9 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
151
click to vote
IPPS
2007
IEEE
16 years 21 days ago
2007
IEEE
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
155
click to vote
HPDC
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...