2698 search results - page 328 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
175
click to vote
WINE
2005
Springer
16 years 7 hour ago
2005
Springer
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
180
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
180
click to vote
MOBICOM
2006
ACM
16 years 15 days ago
2006
ACM
For data-collection applications in sensor networks, it is important to ensure all data sources have equal (or weighted) access to network bandwidth so that the base stations rece...
161
click to vote
NIPS
2007
15 years 8 months ago
2007
In many applications, one has to actively select among a set of expensive observations before making an informed decision. Often, we want to select observations which perform well...
153
click to vote
ICCAD
2009
IEEE
15 years 4 months ago
2009
IEEE
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...