2694 search results - page 333 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
175
click to vote
CLUSTER
2001
IEEE
15 years 10 months ago
2001
IEEE
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
187
click to vote
ICCAD
2009
IEEE
15 years 4 months ago
2009
IEEE
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
160
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
156
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we examine the problem of choosing discriminatory prices for customers with probabilistic valuations and a seller with indistinguishable copies of a good. ...
136
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
— Since the Estimation of Distribution Algorithms (EDAs) have been introduced, several single model based EDAs and mixture model based EDAs have been developed. Take Gaussian mod...