3049 search results - page 35 / 610 » On the Convergence of Bound Optimization Algorithms |
ICCAD
1996
IEEE
13 years 11 months ago
1996
IEEE
We consider non-uniform wire-sizing for general routing trees under the Elmore delay model. Three minimization objectives are studied: 1) total weighted sink-delays; 2) total area...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
RECOMB
2004
Springer
14 years 8 months ago
2004
Springer
INFOCOM
1997
IEEE
13 years 11 months ago
1997
IEEE
In noncooperative networks, resources are shared among selfish users, which optimize their individual performance measure. We consider the generic and practically important case o...
IJON
2007
13 years 7 months ago
2007
Piecewise linear networks (PLNs) are attractive because they can be trained quickly and provide good performance in many nonlinear approximation problems. Most existing design alg...