Sciweavers

502 search results - page 16 / 101
» Monotone Approximation of Decision Problems
Sort
View
WADS
2007
Springer
140views Algorithms» more  WADS 2007»
15 years 3 months ago
A Stab at Approximating Minimum Subadditive Join
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
Staal A. Vinterbo
TOC
2010
127views Management» more  TOC 2010»
14 years 4 months ago
The Submodular Welfare Problem with Demand Queries
: We consider the Submodular Welfare Problem where we have m items and n players with given utility functions wi : 2[m] R+. The utility functions are assumed to be monotone and su...
Uriel Feige, Jan Vondrák
MOR
2007
109views more  MOR 2007»
14 years 9 months ago
Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes
We consider the problem of solving a nonhomogeneous infinite horizon Markov Decision Process (MDP) problem in the general case of potentially multiple optimal first period polic...
Torpong Cheevaprawatdomrong, Irwin E. Schochetman,...
PREMI
2005
Springer
15 years 3 months ago
Geometric Decision Rules for Instance-Based Learning Problems
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
Binay K. Bhattacharya, Kaustav Mukherjee, Godfried...
71
Voted
AIPS
2003
14 years 11 months ago
Recommendation as a Stochastic Sequential Decision Problem
Recommender systems — systems that suggest to users in e-commerce sites items that might interest them — adopt a static view of the recommendation process and treat it as a pr...
Ronen I. Brafman, David Heckerman, Guy Shani