Sciweavers

491 search results - page 45 / 99
» A Fast KNN Algorithm Based on Simulated Annealing
Sort
View
CEC
2010
IEEE
13 years 6 months ago
Real-coded differential crisp clustering for MRI brain image segmentation
Abstract-- In this paper, a segmentation technique of multispectral magnetic resonance image of the brain using a new differential evolution based crisp clustering is proposed. Rea...
Indrajit Saha, Ujjwal Maulik, Sanghamitra Bandyopa...
JSAC
2006
163views more  JSAC 2006»
13 years 8 months ago
Fast and Scalable Pattern Matching for Network Intrusion Detection Systems
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packets....
Sarang Dharmapurikar, John W. Lockwood
ICRA
2000
IEEE
115views Robotics» more  ICRA 2000»
14 years 10 days ago
Virtual Obstacle Concept for Local-Minimum Recovery in Potential-Field Based Navigation
We present a navigation algorithm, which integrates virtual obstacle concept with a potential-field-based method to maneuver cylindrical mobile robots in unknown or unstructured e...
Liu Chengqing, Marcelo H. Ang, Hariharan Krishnan,...
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 6 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
14 years 2 months ago
An improved restricted growth function genetic algorithm for the consensus clustering of retinal nerve fibre data
This paper describes an extension to the Restricted Growth Function grouping Genetic Algorithm applied to the Consensus Clustering of a retinal nerve fibre layer data-set. Consens...
Stephen Swift, Allan Tucker, Jason Crampton, David...