Sciweavers

686 search results - page 90 / 138
» Inexact pattern matching using genetic algorithm
Sort
View
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
14 years 1 months ago
Observing the swarm behaviour during its evolutionary design
Evolutionary Algorithms (EAs) can be used for designing Particle Swarm Optimization (PSO) algorithms that work, in some cases, considerably better than the human-designed ones. By...
Laura Diosan, Mihai Oltean
FPGA
2010
ACM
276views FPGA» more  FPGA 2010»
14 years 4 months ago
Accelerating Monte Carlo based SSTA using FPGA
Monte Carlo based SSTA serves as the golden standard against alternative SSTA algorithms, but it is seldom used in practice due to its high computation time. In this paper, we acc...
Jason Cong, Karthik Gururaj, Wei Jiang, Bin Liu, K...
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 9 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
ICMCS
2005
IEEE
138views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Overcomplete ICA-based Manmade Scene Classification
Principal Component Analysis (PCA) has been widely used to extract features for pattern recognition problems such as object recognition. Oliva and Torralba used “spatial envelop...
Matthew Boutell, Jiebo Luo
OOPSLA
2010
Springer
13 years 5 months ago
A recommender for conflict resolution support in optimistic model versioning
The usage of optimistic version control systems comes along with cumbersome and time-consuming conflict resolution in the case that the modifications of two developers are contrad...
Petra Brosch, Martina Seidl, Gerti Kappel