420 search results - page 23 / 84 » Search on High Degree Graphs |
106
click to vote
CPC
2007
15 years 20 days ago
2007
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
104
Voted
FLAIRS
2004
15 years 2 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
100
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
ACSAC
2004
IEEE
15 years 4 months ago
2004
IEEE
We map intrusion events to known exploits in the network attack graph, and correlate the events through the corresponding attack graph distances. From this, we construct attack sc...
ENTCS
2006
15 years 21 days ago
2006
A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives ...