Sciweavers

783 search results - page 75 / 157
» Improved approximation algorithms for the freeze-tag problem
Sort
View
CIAC
2006
Springer
111views Algorithms» more  CIAC 2006»
14 years 16 days ago
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
SIGECOM
2009
ACM
108views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
Selling ad campaigns: online algorithms with cancellations
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...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...
IPL
2010
114views more  IPL 2010»
13 years 7 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
ICML
2000
IEEE
14 years 9 months ago
Combining Reinforcement Learning with a Local Control Algorithm
We explore combining reinforcement learning with a hand-crafted local controller in a manner suggested by the chaotic control algorithm of Vincent, Schmitt and Vincent (1994). A c...
Andrew G. Barto, Jette Randløv, Michael T. ...
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 1 months ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...