Sciweavers

166 search results - page 28 / 34
» Fixed-parameter evolutionary algorithms and the vertex cover...
Sort
View
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
15 years 3 months ago
Alternative techniques to solve hard multi-objective optimization problems
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
Ricardo Landa Becerra, Carlos A. Coello Coello, Al...
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 3 months ago
Evolving computer intrusion scripts for vulnerability assessment and log analysis
Evolutionary computation is used to construct undetectable computer attack scripts. Using a simulated operating system, we show that scripts can be evolved to cover their tracks a...
Julien Budynek, Eric Bonabeau, Ben Shargel
CPC
2006
110views more  CPC 2006»
14 years 9 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
GECCO
2006
Springer
154views Optimization» more  GECCO 2006»
15 years 1 months ago
Emergent mating topologies in spatially structured genetic algorithms
The application of network analysis to emergent mating topologies in spatially structured genetic algorithms is presented in this preliminary study as a framework for inferring ev...
Joshua L. Payne, Margaret J. Eppstein
76
Voted
ICPR
2008
IEEE
15 years 3 months ago
Detecting hubs and quasi cliques in scale-free networks
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...
Sriganesh Srihari, Hoong Kee Ng, Kang Ning, Hon Wa...