2542 search results - page 169 / 509 » Computing Cartograms with Optimal Complexity |
106
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, wh...
93
Voted
DAC
2005
ACM
16 years 2 months ago
2005
ACM
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
129
Voted
PODC
2003
ACM
15 years 6 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
118
Voted
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...
132
Voted
FOCS
1999
IEEE
15 years 5 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...