6437 search results - page 602 / 1288 » Parallel Algorithms for Arrangements |
180
click to vote
CPM
1993
Springer
15 years 11 months ago
1993
Springer
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 ...
244
click to vote
PROPERTYTESTING
2010
15 years 5 months ago
2010
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...
155
click to vote
ICML
2003
IEEE
16 years 8 months ago
2003
IEEE
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...
200
Voted
PPAM
2007
Springer
16 years 1 months ago
2007
Springer
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...
212
click to vote
ALGORITHMICA
2002
15 years 7 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...