2694 search results - page 389 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
169
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
The need for high performance and throughput Question Answering (QA) systems demands for their migration to distributed environments. However, even in such cases it is necessary t...
179
click to vote
ICCAD
2003
IEEE
15 years 11 months ago
2003
IEEE
This work presents a formal probabilistic approach for solving optimization problems in design automation. Prediction accuracy is very low especially at high levels of design flo...
161
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
168
click to vote
DC
2006
15 years 6 months ago
2006
We consider the problem of how to schedule t similar and independent tasks to be performed in a synchronous distributed system of p stations communicating via multiple-access chan...
140
click to vote
GLOBECOM
2006
IEEE
16 years 15 days ago
2006
IEEE
— We study the problem of building an optimal network-layer clustering hierarchy, where the optimality can be defined using three potentially conflicting metrics: state, delay ...