Sciweavers

71228 search results - page 215 / 14246
» Algorithms
Sort
View
IJCAI
2001
15 years 3 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
ISCAPDCS
2001
15 years 3 months ago
A Study of Parallel Monitoring Algorithm in ATM Network Admission Control
Admission control strategies play an important role in congestion control and in guaranteeing the quality of service in Asynchronous Transfer Mode (ATM) networks. Three categories...
Mansoor Alam, Carl Weisfelder, Min Song
FLAIRS
2003
15 years 3 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
NIPS
2004
15 years 3 months ago
Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms
We provide a worst-case analysis of selective sampling algorithms for learning linear threshold functions. The algorithms considered in this paper are Perceptron-like algorithms, ...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
SODA
2001
ACM
166views Algorithms» more  SODA 2001»
15 years 3 months ago
Better approximation algorithms for bin covering
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
János Csirik, David S. Johnson, Claire Keny...
« Prev « First page 215 / 14246 Last » Next »