2899 search results - page 359 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
178
click to vote
ASPDAC
2005
ACM
16 years 2 days ago
2005
ACM
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
176
click to vote
GECCO
2005
Springer
16 years 1 days ago
2005
Springer
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
155
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
177
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
157
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...