5606 search results - page 330 / 1122 » Randomization Techniques for Graphs. |
179
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....
172
click to vote
GEM
2007
15 years 8 months ago
2007
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...
154
click to vote
CCS
2004
ACM
16 years 5 hour ago
2004
ACM
Address-space randomization is a technique used to fortify systems against bu er over
ow attacks. The idea is to introduce arti cial diversity by randomizing the memory location o...
145
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
Even sophisticated techniques start out from simple ideas. Later, in reply to application needs or theoretical problems new concepts are introduced and new formalisations proposed...
155
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
This study examines the utility of grammatical ephemeral random constants, and conducts an analysis of the preferences of evolutionary search when a number of different grammar ba...