17760 search results - page 335 / 3552 » A Generalization of the Massey-Ding Algorithm |
179
click to vote
COLT
1992
Springer
15 years 11 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
189
click to vote
ICML
1995
IEEE
16 years 7 months ago
1995
IEEE
A number of reinforcement learning algorithms have been developed that are guaranteed to converge to the optimal solution when used with lookup tables. It is shown, however, that ...
186
click to vote
SIGPRO
2008
15 years 6 months ago
2008
The LMS algorithm is one of the most popular learning algorithms for identifying an unknown system. Many variants of the algorithm have been developed based on different problem f...
173
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
191
click to vote
ESA
1997
Springer
15 years 11 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...