188 search results - page 29 / 38 » Evolutionary Algorithms for Vertex Cover |
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
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...
107
click to vote
JAL
2006
14 years 11 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
EVOW
2009
Springer
15 years 6 months ago
2009
Springer
In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was sh...
100
click to vote
FUN
2007
Springer
15 years 3 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
CPC
2006
14 years 11 months ago
2006
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 ...