2694 search results - page 111 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
108
Voted
PODC
1999
ACM
15 years 6 months ago
1999
ACM
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
121
click to vote
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
We present a large-margin formulation and algorithm for structured output prediction that allows the use of latent variables. Our proposal covers a large range of application prob...
143
Voted
ASIAN
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
KBSE
2010
IEEE
15 years 1 months ago
2010
IEEE
The installation of software packages depends on the correct resolution of dependencies and conflicts between packages. This problem is NP-complete and, as expected, is a hard ta...
112
click to vote
AAAI
2008
15 years 4 months ago
2008
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...