4843 search results - page 622 / 969 » The Shortcut Problem - Complexity and Approximation |
136
click to vote
SIGECOM
2009
ACM
15 years 11 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...
130
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
141
click to vote
AAAI
2007
15 years 6 months ago
2007
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
143
click to vote
IJCAI
2007
15 years 5 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
142
click to vote
TON
2010
15 years 2 months ago
2010
—We develop analytical models to characterize pricing of spectrum rights in cellular CDMA networks. Specifically, we consider a primary license holder that aims to lease its spe...