4894 search results - page 632 / 979 » The Guarding Problem - Complexity and Approximation |
118
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
128
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
131
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—In transportation network research, the main approach for predicting traffic distribution due to noncooperative vehicle choices has been through fluid type models. The...
135
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
In several agent-oriented scenarios in the real world, an autonomous agent that is situated in an unknown environment must learn through a process of trial and error to take actio...
136
click to vote
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...