1541 search results - page 141 / 309 » Analysis of Random Noise and Random Walk Algorithms |
121
Voted
STOC
2004
ACM
16 years 5 months ago
2004
ACM
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
185
click to vote
ACST
2006
15 years 6 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
155
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
130
Voted
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
140
Voted
NIPS
2004
15 years 6 months ago
2004
We provide a worst-case analysis of selective sampling algorithms for learning linear threshold functions. The algorithms considered in this paper are Perceptron-like algorithms, ...