206 search results - page 27 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— With the constraints of network topologies and link capacities, achieving the optimal end-to-end throughput in data networks has been known as a fundamental but computationally...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Review assignment is a common task that many people such as conference organizers, journal editors, and grant administrators would have to do routinely. As a computational problem...
108
click to vote
SDM
2011
SIAM
14 years 13 days ago
2011
SIAM
When multiple data sources are available for clustering, an a priori data integration process is usually required. This process may be costly and may not lead to good clusterings,...
ALGORITHMICA
1998
14 years 9 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
PODS
2010
ACM
15 years 2 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...