Sciweavers

16093 search results - page 122 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
136
Voted
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
CEC
2009
IEEE
15 years 8 months ago
Gradient estimation in global optimization algorithms
Abstract— The role of gradient estimation in global optimization is investigated. The concept of a regional gradient is introduced as a tool for analyzing and comparing different...
Megan Hazen, Maya R. Gupta
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
15 years 7 months ago
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as po...
Daniel Lemire, Martin Brooks, Yuhong Yan
WDAG
2001
Springer
100views Algorithms» more  WDAG 2001»
15 years 6 months ago
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space c...
Faith E. Fich, Colette Johnen
ICPADS
1996
IEEE
15 years 5 months ago
An optimal deadlock resolution algorithm in multidatabase systems
In this paper, we propose a novel deadlock resolution algorithm. In the presence of global deadlocks in a multidatabase system, this algorithm always selects an optimal set of vic...
Xuemin Lin, Jian Chen