Sciweavers

2930 search results - page 461 / 586
» The optimal sequence compression
Sort
View
FLAIRS
2003
15 years 7 months ago
Cost-Based Policy Mapping for Imitation
Imitation represents a powerful approach for programming and autonomous learning in robot and computer systems. An important aspect of imitation is the mapping of observations to ...
Srichandan V. Gudla, Manfred Huber
NIPS
2004
15 years 7 months ago
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
Robert D. Kleinberg
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 7 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
WSC
2004
15 years 7 months ago
Automated Database and Schema-Based Data Interchange for Modeling and Simulation
Creating a simulation of a large enterprise system by manually coding all the details into a simulator tool is not just time consuming, but yields a system that is difficult to ma...
Gregory A. Harrison, David S. Maynard, Eytan Polla...
NIPS
2003
15 years 7 months ago
Online Passive-Aggressive Algorithms
We present a family of margin based online learning algorithms for various prediction tasks. In particular we derive and analyze algorithms for binary and multiclass categorizatio...
Shai Shalev-Shwartz, Koby Crammer, Ofer Dekel, Yor...