Sciweavers

583 search results - page 25 / 117
» New algorithms for efficient parallel string comparison
Sort
View
ICML
2008
IEEE
16 years 18 days ago
Optimized cutting plane algorithm for support vector machines
We have developed a new Linear Support Vector Machine (SVM) training algorithm called OCAS. Its computational effort scales linearly with the sample size. In an extensive empirica...
Sören Sonnenburg, Vojtech Franc
IPPS
1998
IEEE
15 years 4 months ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 5 months ago
Multi-niche crowding in the development of parallel genetic simulated annealing
In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from ...
Zhi-Gang Wang, Mustafizur Rahman 0002, Yoke-San Wo...
DEBS
2007
ACM
15 years 3 months ago
Scalable event matching for overlapping subscriptions in pub/sub systems
Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of opera...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
STRINGOLOGY
2004
15 years 1 months ago
BDD-Based Analysis of Gapped q-Gram Filters
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
Marc Fontaine, Stefan Burkhardt, Juha Kärkk&a...