Sciweavers

1090 search results - page 40 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
JNSM
2008
93views more  JNSM 2008»
13 years 10 months ago
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
Steven Noel, Sushil Jajodia
GECCO
2004
Springer
14 years 3 months ago
Finding Maximum Cliques with Distributed Ants
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...
Thang Nguyen Bui, Joseph R. Rizzo
CORR
2006
Springer
146views Education» more  CORR 2006»
13 years 10 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram
GBRPR
2007
Springer
14 years 4 months ago
Local Reasoning in Fuzzy Attribute Graphs for Optimizing Sequential Segmentation
Spatial relations play a crucial role in model-based image recognition and interpretation due to their stability compared to many other image appearance characteristics. Graphs are...
Geoffroy Fouquier, Jamal Atif, Isabelle Bloch
GECCO
2003
Springer
14 years 3 months ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene