Sciweavers

4843 search results - page 223 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
IWLCS
2005
Springer
15 years 9 months ago
Counter Example for Q-Bucket-Brigade Under Prediction Problem
Aiming to clarify the convergence or divergence conditions for Learning Classifier System (LCS), this paper explores: (1) an extreme condition where the reinforcement process of ...
Atsushi Wada, Keiki Takadama, Katsunori Shimohara
115
Voted
MOC
2000
105views more  MOC 2000»
15 years 3 months ago
On the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed problems
The iteratively regularized Gauss-Newton method is applied to compute the stable solutions to nonlinear ill-posed problems F (x) = y when the data y is given approximately by y wit...
Jin Qi-nian
122
Voted
CPM
2009
Springer
121views Combinatorics» more  CPM 2009»
15 years 10 months ago
LCS Approximation via Embedding into Local Non-repetitive Strings
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
Gad M. Landau, Avivit Levy, Ilan Newman
108
Voted
TAMC
2007
Springer
15 years 9 months ago
Approximately Optimal Trees for Group Key Management with Batch Updates
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...
143
Voted
ICDE
2006
IEEE
208views Database» more  ICDE 2006»
15 years 9 months ago
Approximate Video Search Based on Spatio-Temporal Information of Video Objects
The spatio-temporal information of a video object is important for content-based video retrieval. In this paper the spatio-temporal information of a video object, such as the velo...
Chia-Han Lin, Arbee L. P. Chen