2698 search results - page 359 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
166
click to vote
INFOCOM
2005
IEEE
16 years 2 days ago
2005
IEEE
We consider the problem of neighbor discovery in static wireless ad hoc networks with directional antennas. We propose several probabilistic algorithms in which nodes perform rand...
172
click to vote
JMLR
2010
15 years 1 months ago
2010
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
152
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
144
click to vote
NIPS
2008
15 years 8 months ago
2008
We study the profit-maximization problem of a monopolistic market-maker who sets two-sided prices in an asset market. The sequential decision problem is hard to solve because the ...
145
click to vote
ORL
2008
15 years 6 months ago
2008
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...