Sciweavers

1550 search results - page 226 / 310
» Optimizing search by showing results in context
Sort
View
JAIR
2007
141views more  JAIR 2007»
15 years 6 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
ASIACRYPT
2010
Springer
15 years 4 months ago
Rotational Rebound Attacks on Reduced Skein
Abstract. In this paper we combine a recent rotational cryptanalysis with the rebound attack, which results in the best cryptanalysis of Skein, a candidate for the SHA-3 competitio...
Dmitry Khovratovich, Ivica Nikolic, Christian Rech...
AAAI
2011
14 years 6 months ago
Recommendation Sets and Choice Queries: There Is No Exploration/Exploitation Tradeoff!
Utility elicitation is an important component of many applications, such as decision support systems and recommender systems. Such systems query users about their preferences and ...
Paolo Viappiani, Craig Boutilier
INFOCOM
2006
IEEE
16 years 12 days ago
Generalized Proportional Fair Scheduling in Third Generation Wireless Data Networks
—In 3G data networks, network operators would like to balance system throughput while serving users in a fair manner. This is achieved using the notion of proportional fairness. ...
Tian Bu, L. Li, Ramachandran Ramjee
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
16 years 3 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...