Sciweavers

1301 search results - page 152 / 261
» Bounded Version Vectors
Sort
View
113
Voted
GOSLER
1995
15 years 4 months ago
Learning and Consistency
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
Rolf Wiehagen, Thomas Zeugmann
96
Voted
ALENEX
2008
133views Algorithms» more  ALENEX 2008»
15 years 2 months ago
Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem
The multi-period newsvendor problem describes the dilemma of a newspaper salesman--how many paper should he purchase each day to resell, when he doesn't know the demand? We d...
Shawn O'Neil, Amitabh Chaudhary
FLAIRS
2006
15 years 2 months ago
Toward a Computational Model of Expert Tutoring: A First Report
We are exploring the differences between expert and less expert tutors with two goals: cognitive (what does tutoring tell us about learning) and applied (which features of tutorin...
Barbara Di Eugenio, Trina C. Kershaw, Xin Lu, Andr...
70
Voted
NIPS
2004
15 years 2 months ago
A Cost-Shaping LP for Bellman Error Minimization with Performance Guarantees
We introduce a new algorithm based on linear programming that approximates the differential value function of an average-cost Markov decision process via a linear combination of p...
Daniela Pucci de Farias, Benjamin Van Roy
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
15 years 2 months ago
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
Carlos Brito, Elias Koutsoupias, Shailesh Vaya