Sciweavers

1632 search results - page 141 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
AAAI
2000
15 years 5 months ago
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
Richard E. Korf, Weixiong Zhang
IJCAI
1989
15 years 5 months ago
Training Feedforward Neural Networks Using Genetic Algorithms
Multilayered feedforward neural networks possess a number of properties which make them particularly suited to complex pattern classification problems. However, their application ...
David J. Montana, Lawrence Davis
ICML
1996
IEEE
15 years 8 months ago
A Convergent Reinforcement Learning Algorithm in the Continuous Case: The Finite-Element Reinforcement Learning
This paper presents a direct reinforcement learning algorithm, called Finite-Element Reinforcement Learning, in the continuous case, i.e. continuous state-space and time. The eval...
Rémi Munos
CPM
2006
Springer
112views Combinatorics» more  CPM 2006»
15 years 7 months ago
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes
Abstract. Local similarity is an important tool in comparative analysis of biological sequences, and is therefore well studied. In particular, the Smith-Waterman technique and its ...
Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren...
ICWS
2008
IEEE
15 years 5 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan