Sciweavers

6897 search results - page 673 / 1380
» Parallelization of Modular Algorithms
Sort
View
AISB
1994
Springer
15 years 11 months ago
Formal Memetic Algorithms
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
Nicholas J. Radcliffe, Patrick D. Surry
CPM
1993
Springer
125views Combinatorics» more  CPM 1993»
15 years 11 months ago
Detecting False Matches in String Matching Algorithms
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
S. Muthukrishnan
PROPERTYTESTING
2010
15 years 5 months ago
Sublinear Algorithms in the External Memory Model
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
ICML
2003
IEEE
16 years 7 months ago
Online Ranking/Collaborative Filtering Using the Perceptron Algorithm
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
Edward F. Harrington
PPAM
2007
Springer
16 years 1 months ago
A Cost-Benefit-Based Adaptation Scheme for Multimeme Algorithms
Abstract. Memetic Algorithms are the most frequently used hybrid of Evolutionary Algorithms (EA) for real-world applications. This paper will deal with one of the most important ob...
Wilfried Jakob