90 search results - page 2 / 18 » Maximizing expected utility over a knapsack constraint |
ICML
2009
IEEE
14 years 5 months ago
2009
IEEE
Ranking a set of retrieved documents according to their relevance to a query is a popular problem in information retrieval. Methods that learn ranking functions are difficult to o...
CMOT
1999
13 years 4 months ago
1999
We propose a class of actor-oriented statistical models for closed social networks in general, and friendship networks in particular. The models are random utility models develope...
IOR
2010
13 years 2 months ago
2010
The paper considers a stylized model of a dynamic assortment optimization problem, where given a limited capacity constraint, we must decide the assortment of products to offer to...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract—This paper investigates pricing of Internet connectivity services in the context of a monopoly ISP selling broadband access to consumers. We first study the optimal com...
FLAIRS
2008
13 years 7 months ago
2008
This paper discusses how numerically imprecise information can be modelled and how a risk evaluation process can be elaborated by integrating procedures for numerically imprecise ...