2137 search results - page 298 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
116
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
167
Voted
DIALM
2008
ACM
15 years 6 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
144
click to vote
CDC
2010
IEEE
15 years 1 days ago
2010
IEEE
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
152
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
154
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...