7930 search results - page 373 / 1586 » Greedy in Approximation Algorithms |
196
click to vote
JACM
2006
15 years 6 months ago
2006
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
169
click to vote
INFOCOM
2010
IEEE
15 years 5 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...
204
click to vote
MSWIM
2005
ACM
16 years 9 days ago
2005
ACM
We consider the problem of energy aware localized routing in ad hoc networks. In localized routing algorithms, each node forwards a message based on the position information about...
178
click to vote
JMLR
2010
15 years 1 months ago
2010
We present two Bayesian algorithms CD-B and CD-H for discovering unconfounded cause and effect relationships from observational data without assuming causal sufficiency which prec...
205
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...