4781 search results - page 343 / 957 » Online algorithms for network design |
205
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
190
click to vote
GROUP
2010
ACM
15 years 4 months ago
2010
ACM
Online social production communities allow efficient construction of valuable and high-quality information sources. To be successful, community members must be effective at collab...
189
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
—Taking advantage of the frequency diversity and multiuser diversity in OFDMA based wireless networks, dynamic subcarrier assignment mechanisms have shown to be able to achieve m...
184
click to vote
SIGIR
2004
ACM
16 years 8 days ago
2004
ACM
As online document collections continue to expand, both on the Web and in proprietary environments, the need for duplicate detection becomes more critical. The goal of this work i...
199
click to vote
SIAMJO
2008
15 years 6 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....