Sciweavers

12825 search results - page 318 / 2565
» Improved PLSOM algorithm
Sort
View
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
16 years 4 months ago
Fast SDP Algorithms for Constraint Satisfaction Problems
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
David Steurer
CC
2010
Springer
150views System Software» more  CC 2010»
16 years 2 months ago
Practical Extensions to the IFDS Algorithm
Abstract. This paper presents four extensions to the Interprocedural Finite Distributive Subset (IFDS) algorithm that make it applicable to a wider class of analysis problems. IFDS...
Nomair A. Naeem, Ondrej Lhoták, Jonathan Ro...
ICAS
2009
IEEE
139views Robotics» more  ICAS 2009»
16 years 2 months ago
Predicting Web Server Crashes: A Case Study in Comparing Prediction Algorithms
Abstract—Traditionally, performance has been the most important metrics when evaluating a system. However, in the last decades industry and academia have been paying increasing a...
Javier Alonso, Jordi Torres, Ricard Gavaldà
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
16 years 1 months ago
Integrating real-time analysis with the dendritic cell algorithm through segmentation
As an immune inspired algorithm, the Dendritic Cell Algorithm (DCA) has been applied to a range of problems, particularly in the area of intrusion detection. Ideally, the intrusio...
Feng Gu, Julie Greensmith, Uwe Aickelin
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
16 years 1 months ago
Cheating for problem solving: a genetic algorithm with social interactions
We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary...
Rafael Lahoz-Beltra, Gabriela Ochoa, Uwe Aickelin