Sciweavers

17760 search results - page 5 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
ICNP
1998
IEEE
13 years 12 months ago
A Definition of General Weighted Fairness and its Support in Explicit Rate Switch Algorithms
In this paper we give a general definition of weighted fairness and discuss how a pricing policy can be mapped to general weighted (GW) fairness. The GW fairness can be achieved b...
Bobby Vandalore, Sonia Fahmy, Raj Jain, Rohit Goya...
CAEPIA
2011
Springer
12 years 7 months ago
Evaluating a Reinforcement Learning Algorithm with a General Intelligence Test
In this paper we apply the recent notion of anytime universal intelligence tests to the evaluation of a popular reinforcement learning algorithm, Q-learning. We show that a general...
Javier Insa-Cabrera, David L. Dowe, José He...
IJCAI
2001
13 years 9 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
TCAD
2008
124views more  TCAD 2008»
13 years 7 months ago
An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs
Detecting symmetries has many applications in logic synthesis that include, amongst other things, technology mapping, deciding equivalence of Boolean functions when the input corre...
Neil Kettle, Andy King
ICDAR
2003
IEEE
14 years 1 months ago
An Evolutionary Algorithm for General Symbol Segmentation
A new system is presented for general symbol segmentation, which is applicable for segmentation of any connected string of symbols, including characters and line diagrams. Using a...
Stephen Pearce, Maher Ahmed